Conferences in DBLP

Conference on Computational Complexity / (coco)
1992 (conf/coco/92)

1. Mikael Goldmann, Johan Håstad, Alexander A. Razborov
   Majority Gates vs. General Weighted Threshold Gates. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1992, pp:2-13 [Conf]
   
2. Richard Beigel
   Perceptrons, PP, and the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1992, pp:14-19 [Conf]
   
3. Thomas Hofmeister
   The Power of Negative Thinking in Constructing Threshold Circuits for Addition. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1992, pp:20-26 [Conf]
   
4. Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
   A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1992, pp:27-33 [Conf]
   
5. Rodney G. Downey, Michael R. Fellows
   Fixed-Parameter Intractability. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1992, pp:36-49 [Conf]
   
6. Bin Fu, Hong-Zhou Li, Yong Zhong
   Some Properties of Exponential Time Complexity Classes. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1992, pp:50-57 [Conf]
   
7. J. Ramachandran
   Set Bit Enumeration is Hard. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1992, pp:58-70 [Conf]
   
8. Pankaj Rohatgi
   Saving Queries with Randomness. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1992, pp:71-83 [Conf]
   
9. David A. Mix Barrington
   Quasipolynomial Size Circuit Classes. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1992, pp:86-93 [Conf]
   
10. Martin Beaudry, Pierre McKenzie
    Cicuits, Matrices, and Nonassociative Computation. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:94-106 [Conf]
    
11. Michael R. Fellows, Neal Koblitz
    Self-Witnessing Polynomial-Time Complexity and Prime Factorization. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:107-110 [Conf]
    
12. Frederic Green, Johannes Köbler, Jacobo Torán
    The Power of the Middle Bit. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:111-117 [Conf]
    
13. Antoni Lozano, Jacobo Torán
    On the Nonuniform Complexity on the Graph Isomorphism Problem. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:118-129 [Conf]
    
14. André Berthiaume, Gilles Brassard
    The Quantum Challenge to Structural Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:132-137 [Conf]
    
15. Nikolai K. Vereshchagin
    On The Power of PP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:138-143 [Conf]
    
16. Lide Li
    Formal Power Series: An Algebraic Approach to the GapP and #P Functions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:144-154 [Conf]
    
17. Serge Abiteboul, Moshe Y. Vardi, Victor Vianu
    Fixpoint Logics, Relational Machines, and Computational Complexity. [Citation Graph (2, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:156-168 [Conf]
    
18. Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur
    Descriptive Complexity of #P Functions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:169-184 [Conf]
    
19. Steven Lindell
    A Purely Logical Characterization of Circuit Uniformity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:185-192 [Conf]
    
20. Stephen A. Bloch
    Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:193-206 [Conf]
    
21. Manindra Agrawal, Somenath Biswas
    Universal Relations. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:207-220 [Conf]
    
22. Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
    How Hard Are Sparse Sets? [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:222-238 [Conf]
    
23. Desh Ranjan, Pankaj Rohatgi
    On Randomized Reductions to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:239-242 [Conf]
    
24. Bin Fu, Hong-Zhou Li
    On Closeness of NP-Hard Sets to Other Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:243-248 [Conf]
    
25. Ricard Gavaldà
    Bounding the Complexity of Advice Functions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:249-254 [Conf]
    
26. Ronald V. Book, Jack H. Lutz
    On Languages with Very High Information Content. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:255-259 [Conf]
    
27. Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan
    Fractional Covers and Communication Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:262-274 [Conf]
    
28. Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson
    Non-deterministic Communication Complexity with Few Witness. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:275-281 [Conf]
    
29. Anne Condon, Richard E. Ladner
    Interactive Proof Systems with Polynomially Bounded Strategies. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:282-294 [Conf]
    
30. Farrokh Vatan
    Some Lower and Upper Bounds for Algebraic Decision Trees and the Separation Problem. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:295-304 [Conf]
    
31. Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer
    Average Dependence and Random Oracles. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:306-317 [Conf]
    
32. Jie Wang, Jay Belanger
    On Average P vs. Average NP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:318-326 [Conf]
    
33. Ker-I Ko
    A Note on the Instance Complexity of Pseudorandom Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:327-337 [Conf]
    
34. Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman
    The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:338-346 [Conf]