The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Conferences in DBLP

Conference on Computational Complexity / (coco)
1994 (conf/coco/94)

  1. Mitsunori Ogihara
    Polynomial-Time Membership Comparable Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:2-11 [Conf]
  2. Richard Beigel, Martin Kummer, Frank Stephan
    Approximable Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:12-23 [Conf]
  3. Manindra Agrawal, Vikraman Arvind
    Polynomial Time Truth-Table Reductions to P-Selective Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:24-30 [Conf]
  4. Richard Chang
    On the Query Complexity of Clique Size and Maximum Satisfiability. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:31-42 [Conf]
  5. Harry Buhrman, Jim Kadin, Thomas Thierauf
    On Functions Computable with Nonadaptive Queries to NP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:43-52 [Conf]
  6. Sarah Mocas
    Using Bounded Query Classes to Separate Classes in the Exponential Time Hierarchy from Classes in PH. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:53-58 [Conf]
  7. Avi Wigderson
    NL/poly <= +/poly (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:59-62 [Conf]
  8. Maciej Liskiewicz, Rüdiger Reischuk
    The Complexity World below Logarithmic Space. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:64-78 [Conf]
  9. Richard J. Lipton
    Some Consequences of Our Failure to Prove Non-Linear Lower Bounds on Explicit Functions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:79-87 [Conf]
  10. Russell Impagliazzo, Ran Raz, Avi Wigderson
    A Direct Product Theorem. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:88-96 [Conf]
  11. Shai Ben-David, Mauricio Karchmer, Eyal Kushilevitz
    On Ultrafilters and NP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:97-105 [Conf]
  12. Klaus-Jörn Lange, Peter Rossmanith
    Unambiguous Polynomial Hierarchies and Exponential Size. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:106-115 [Conf]
  13. Harry Buhrman, Leen Torenvliet
    On the Structure of Complete Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:118-133 [Conf]
  14. Richard Beigel, Judy Goldsmith
    Downward separation fails catastrophically for limited nondeterminism classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:134-138 [Conf]
  15. Lance Fortnow, Tomoyuki Yamakami
    Generic Separations. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:139-145 [Conf]
  16. Jack H. Lutz
    Weakly Hard Problems. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:146-161 [Conf]
  17. Steven M. Kautz, Peter Bro Miltersen
    Relative to a Random Oracle, NP is Not Small. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:162-174 [Conf]
  18. David A. Mix Barrington, Neil Immerman
    Time, Hardware, and Uniformity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:176-185 [Conf]
  19. Xiangdong Yu, Moti Yung
    Space Lower-Bounds for Pseudorandom-Generators. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:186-197 [Conf]
  20. Bernd Meyer
    Constructive Separation of Classes of Indistinguishable Ensembles. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:198-204 [Conf]
  21. Osamu Watanabe
    Test Instance Generation for Promise NP Search Problems. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:205-216 [Conf]
  22. Harry Buhrman, Pekka Orponen
    Random Strings Make Hard Instances. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:217-222 [Conf]
  23. Ulrich Hertrampf
    Complexity Classes Defined via k-valued Functions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:224-234 [Conf]
  24. Bernd Borchert
    Predicate Classes and Promise Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:235-241 [Conf]
  25. Birgit Jenner, Pierre McKenzie, Denis Thérien
    Logspace and Logtime Leaf Languages. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:242-254 [Conf]
  26. Kevin J. Compton, Erich Grädel
    Logical Definability of Counting Functions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:255-266 [Conf]
  27. Eric Allender, Mitsunori Ogihara
    Relationships Among PL, #L, and the Determinant. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:267-278 [Conf]
  28. Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor
    Random Debaters and the Hardness of Approximating Stochastic Functions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:280-293 [Conf]
  29. Marcos A. Kiwi, Carsten Lund, Alexander Russell, Daniel A. Spielman, Ravi Sundaram
    Alternation in Interaction. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:294-303 [Conf]
  30. Oleg Verbitsky
    Towards the Parallel Repetition Conjecture. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:304-307 [Conf]
  31. Gábor Tardos
    Multi-Prover Encoding Schemes and Three-Prover Proof Systems. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:308-317 [Conf]
  32. Christos H. Papadimitriou, John N. Tsitsiklis
    The Complexity of Optimal Queueing Network Control. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:318-322 [Conf]
  33. Ricard Gavaldà
    The Complexity of Learning with Queries. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:324-337 [Conf]
  34. Manindra Agrawal
    On the Isomorphism Problem for Weak Reducibilities. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:338-355 [Conf]
  35. Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns
    Generalized CNF Satisfiability Problems and Non-Efficient. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:356-366 [Conf]
  36. Deborah Joseph, Randall Pruim, Paul Young
    Collapsing Degrees in Subexponential Time. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:367-382 [Conf]
  37. Pavel Pudlák
    Complexity Theory and Genetics. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:383-395 [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002