The SCEAS System
Navigation Menu

Conferences in DBLP

Conference on Computational Complexity / (coco)
2000 (conf/coco/2000)

  1. Lance Fortnow, Dieter van Melkebeek
    Time-Space Tradeoffs for Nondeterministic Computation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:2-13 [Conf]
  2. Ketan Mulmuley, Pradyut Shah
    A Lower Bound for the Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:14-21 [Conf]
  3. Iannis Tourlakis
    Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:22-0 [Conf]
  4. Oliver Giel
    BP(L(f)1+epsilon). [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:36-43 [Conf]
  5. Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet
    The Communication Complexity of Enumeration, Elimination, and Selection. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:44-53 [Conf]
  6. Richard Cleve
    The Query Complexity of Order-Finding. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:54-0 [Conf]
  7. David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie
    On the Complexity of Some Problems on Groups Input as Multiplication Tables. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:62-69 [Conf]
  8. Carsten Damm, Markus Holzer, Pierre McKenzie
    The Complexity of Tensor Calculus. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:70-86 [Conf]
  9. Thanh Minh Hoang, Thomas Thierauf
    The Complexity of Verifying the Characteristic Polynomial and Testing Similarity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:87-0 [Conf]
  10. Jeff Kahn, Michael E. Saks, Clifford D. Smyth
    A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:98-103 [Conf]
  11. Gabriel Istrate
    Computational Complexity and Phase Transitions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:104-115 [Conf]
  12. Oliver Kullmann
    An Application of Matroid Theory to the SAT Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:116-0 [Conf]
  13. Harry Buhrman, Sophie Laplante, Peter Bro Miltersen
    New Bounds for the Language Compression Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:126-130 [Conf]
  14. Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin
    Combinatorial Interpretation of Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:131-137 [Conf]
  15. Nikolai K. Vereshchagin, Michael V. Vyugin
    Independent Minimum Length Programs to Translate between Given Strings. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:138-0 [Conf]
  16. Luca Trevisan
    A Survey of Optimal PCP Characterizations of NP. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:146-0 [Conf]
  17. Valentine Kabanets
    Easiness Assumptions and Hardness Tests: Trading Time for Zero Error. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:150-157 [Conf]
  18. Jack H. Lutz
    Dimension in Complexity Classes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:158-169 [Conf]
  19. Andreas Jakoby, Rüdiger Reischuk
    Average Case Complexity of Unbounded Fanin Circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:170-0 [Conf]
  20. Venkatesan Guruswami, Sanjeev Khanna
    On the Hardness of 4-Coloring a 3-Colorable Graph. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:188-197 [Conf]
  21. Marcus Schaefer
    Deciding the K-Dimension is PSPACE-Complete. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:198-203 [Conf]
  22. Ke Yang
    Integer Circuit Evaluation is PSPACE-Complete. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:204-0 [Conf]
  23. Pavol Duris, Juraj Hromkovic, Katsushi Inoue
    A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:214-228 [Conf]
  24. George Karakostas, Richard J. Lipton, Anastasios Viglas
    On the Complexity of Intersecting Finite State Automata. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:229-234 [Conf]
  25. Andrei A. Voronenko
    On the Complexity of the Monotonicity Verification. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:235-238 [Conf]
  26. André Berthiaume, Wim van Dam, Sophie Laplante
    Quantum Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:240-249 [Conf]
  27. Frederic Green, Steven Homer, Chris Pollett
    On the Complexity of Quantum ACC. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:250-262 [Conf]
  28. Paul M. B. Vitányi
    Three Approaches to the Quantitative Definition of Information in an Individual Pure Quantum State. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:263-270 [Conf]
  29. Ronald de Wolf
    Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:271-278 [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