The SCEAS System
Navigation Menu

Conferences in DBLP

Conference on Computational Complexity / (coco)
1990 (conf/coco/90)

  1. Mitsunori Ogiwara, Osamu Watanabe
    On Polynominal Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:2- [Conf]
  2. Steven Homer
    Structural Properties of Nondeterministic Complete Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:3-10 [Conf]
  3. Lane A. Hemachandra, Albrecht Hoene
    On Sets with Efficient Implicit Membership Tests. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:11-19 [Conf]
  4. Pekka Orponen
    On the Instance Complexity of NP-Hard Problems. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:20-27 [Conf]
  5. László Babai
    E-mail and the Unexpected Power of Interaction. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:30-44 [Conf]
  6. Jin-yi Cai, Anne Condon, Richard J. Lipton
    On Bounded Round Multi-Prover Interactive Proof Systems. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:45-54 [Conf]
  7. Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz
    Privacy, Additional Information, and Communication. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:55-65 [Conf]
  8. Péter Hajnal
    On the Power of Randomness in the Decision Tree Model. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:66-77 [Conf]
  9. Rafi Heiman, Ilan Newman, Avi Wigderson
    On Read-Once Threshold Formulae and Their Randomized Decision Tree Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:78-87 [Conf]
  10. Yishay Mansour, Noam Nisan, Prasoon Tiwari
    The Computational Complexity of Universal Hashing. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:90- [Conf]
  11. Ilan Newman, Prabhakar Ragde, Avi Wigderson
    Perfect Hashing, Graph Entropy, and Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:91-99 [Conf]
  12. Joan Feigenbaum, Sampath Kannan, Noam Nisan
    Lower Bounds on Random-Self-Reducibility. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:100-109 [Conf]
  13. Martin Mundhenk, Rainer Schuler
    Non-Uniform Complexity Classes and Random Languages. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:110-119 [Conf]
  14. Eric Allender, Christopher B. Wilson
    Width-Bounded Reducibility and Binary Search over Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:122-129 [Conf]
  15. Klaus-Jörn Lange
    Unambiguity of Circuits. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:130-137 [Conf]
  16. Thomas Gundermann, Nasser Ali Nasser, Gerd Wechsung
    A Survey on Counting Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:140-153 [Conf]
  17. Carme Àlvarez, Birgit Jenner
    A Very Hard Log Space Counting Class. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:154-168 [Conf]
  18. Richard Chang, Jim Kadin
    The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:169-178 [Conf]
  19. Noam Nisan
    On Read-Once vs. Multiple Access to Randomness in Logspace. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:179-184 [Conf]
  20. Peter Clote
    Bounded Arithmetic and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:186-199 [Conf]
  21. François Bédard, François Lemieux, Pierre McKenzie
    Extensions to Barrington's M-Program Model. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:200-209 [Conf]
  22. James F. Lynch
    The Quantifier Structure of Sentences that Characterize Nondeterministic Time Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:210-222 [Conf]
  23. V. Vinay, H. Venkateswaran, C. E. Veni Madhavan
    Circuits, Pebbling and Expressibility. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:223-230 [Conf]
  24. Amihood Amir, Richard Beigel, William I. Gasarch
    Some Connections Between Bounded Query Classes and Non-Uniform Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:232-243 [Conf]
  25. Alessandro Panconesi, Desh Ranjan
    Quantifiers and Approximation (Abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:244- [Conf]
  26. Gerhard Lischke
    Impossibilities and Possibilities of Weak Separation Between NP and Exponential Time. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:245-253 [Conf]
  27. Jie Wang
    P-Productivity and Polynominal Time Approximations. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:254-265 [Conf]
  28. Jack H. Lutz, William J. Schmidt
    Circuit Size Relative to Pseudorandom Oracles. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:268-286 [Conf]
  29. Lane A. Hemachandra, Roy S. Rubinstein
    A Note on Relativizing Complexity Classes with Tally Oracles. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:287-294 [Conf]
  30. Frederic Green
    An Oracle Separating +P From PPph. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:295-298 [Conf]
  31. Ronald V. Book
    On Separating Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:299-304 [Conf]
  32. Johannes Köbler, Thomas Thierauf
    Complexity Classes with Advice. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:305-315 [Conf]
  33. Lance Fortnow, John Rompel, Michael Sipser
    Errata for On the Power of Multi-Prover Interactive Protocols. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:318-319 [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