The SCEAS System
Navigation Menu

Conferences in DBLP

Conference on Computational Complexity / (coco)
1991 (conf/coco/91)

  1. Seinosuke Toda, Mitsunori Ogiwara
    Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:2-12 [Conf]
  2. Lance Fortnow, Nick Reingold
    PP is Closed Under Truth-Table Reductions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:13-15 [Conf]
  3. Mitsunori Ogiwara, Lane A. Hemachandra
    A Complexity Theory for Feasible Closure Properties. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:16-29 [Conf]
  4. Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz
    Gap-Definable Counting Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:30-42 [Conf]
  5. Sanjay Gupta
    The Power of Witness Reduction. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:43-59 [Conf]
  6. William I. Gasarch
    Bounded Queries in Recursion Theory: A Survey. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:62-78 [Conf]
  7. Steven Homer, Luc Longpré
    On Reductions of NP Sets to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:79-88 [Conf]
  8. Ricard Gavaldà, Osamu Watanabe
    On the Computational Complexity of Small Descriptions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:89-101 [Conf]
  9. Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri
    Complexity Classes and Sparse Oracles. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:102-108 [Conf]
  10. Jin-yi Cai, Anne Condon, Richard J. Lipton
    PSPACE Is Provable By Two Provers In One Round. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:110-115 [Conf]
  11. Uriel Feige
    On the Success Probability of the Two Provers in One-Round Proof Systems. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:116-123 [Conf]
  12. Joan Feigenbaum, Lance Fortnow
    On the Random-Self-Reducibility of Complete Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:124-132 [Conf]
  13. Rafail Ostrovsky
    One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:133-138 [Conf]
  14. Mitsunori Ogiwara, Antoni Lozano
    On One Query Self-Reducible Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:139-151 [Conf]
  15. Ming Li, Paul M. B. Vitányi
    Combinatorics and Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:154-163 [Conf]
  16. Peter Bro Miltersen
    The Complexity of Malign Ensembles. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:164-171 [Conf]
  17. Rafi Heiman, Avi Wigderson
    Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:172-179 [Conf]
  18. Miklos Santha
    On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:180-187 [Conf]
  19. Jack H. Lutz
    A Pseudorandom Oracle Characterization of BPP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:190-195 [Conf]
  20. Stephen A. Fenner
    Notions of Resource-Bounded Category and Genericity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:196-212 [Conf]
  21. László Babai, Noam Nisan
    BPP has Subexponential Time Simulation unless EXPTIME has Pubishable Proofs. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:213-219 [Conf]
  22. Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
    Relating Equivalence and Reducibility to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:220-229 [Conf]
  23. Shouwen Tang, Bin Fu, Tian Liu
    Exponential Time and Subexponential Time Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:230-237 [Conf]
  24. José L. Balcázar
    Adaptive Logspace and Depth-Bounded Reducibilities. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:240-254 [Conf]
  25. Richard Chang, Jim Kadin, Pankaj Rohatgi
    Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:255-269 [Conf]
  26. V. Vinay
    Counting Auxiliary Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:270-284 [Conf]
  27. Richard Beigel, Nick Reingold, Daniel A. Spielman
    The Perceptron Strikes Back. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:286-291 [Conf]
  28. Michelangelo Grigni, Michael Sipser
    Monotone Separation of Logspace from NC. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:294-298 [Conf]
  29. Mauricio Karchmer, Ran Raz, Avi Wigderson
    Super-logarithmic Depth Lower Bounds via Direct Sum in Communication Coplexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:299-304 [Conf]
  30. David A. Mix Barrington, Howard Straubing
    Superlinear Lower Bounds for Bounded-Width Branching Programs. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:305-313 [Conf]
  31. Matthias Krause
    Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:314-321 [Conf]
  32. Jeff Edmonds
    Lower Bounds with Smaller Domain Size On Concurrent Write Parallel Machines. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:322-331 [Conf]
  33. Neil Immerman
    DSPACE[nk] = VAR[k+1]. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:334-340 [Conf]
  34. Erich Grädel
    Capturing Complexity Classes by Fragments of Second Order Logic. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:341-352 [Conf]
  35. Phokion G. Kolaitis, Madhukar N. Thakur
    Approximation Properties of NP Minimization Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:353-366 [Conf]
  36. Stephen Bellantoni, Toniann Pitassi, Alasdair Urquhart
    Approximation and Small Depth Frege Proofs. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:367-390 [Conf]
  37. Jun Tarui
    Degree Compexity of Boolean Functions and Its Applications to Realivized Separations. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:382-390 [Conf]
  38. Jack H. Lutz, William J. Schmidt
    Errata for Circuit Size to Pseudorandom Oracles. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:392- [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002