The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Luca Trevisan, Salil P. Vadhan, David Zuckerman
    Compression of Samplable Sources. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:1-14 [Conf]
  2. Harry Buhrman, Troy Lee, Dieter van Melkebeek
    Language Compression and Pseudorandom Generators. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:15-28 [Conf]
  3. Hoeteck Wee
    On Pseudoentropy versus Compressibility. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:29-41 [Conf]
  4. Christian Glaßer, Alan L. Selman, Samik Sengupta
    Reductions between Disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:42-53 [Conf]
  5. Josh Buresh-Oppenheim, Tsuyoshi Morioka
    Relativized NP Search Problems and Propositional Proof Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:54-67 [Conf]
  6. Nicola Galesi, Neil Thapen
    The Complexity of Treelike Systems over lamda-Local Formulae. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:68-74 [Conf]
  7. Andrej Bogdanov, Luca Trevisan
    Lower Bounds for Testing Bipartiteness in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:75-81 [Conf]
  8. Alan L. Selman, Samik Sengupta
    Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:82-90 [Conf]
  9. Vikraman Arvind, Jacobo Torán
    Solvable Group Isomorphism. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:91-103 [Conf]
  10. John M. Hitchcock
    Small Spans in Scaled Dimension. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:104-112 [Conf]
  11. Ilan Newman
    Computing in Fault Tolerance Broadcast Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:113-122 [Conf]
  12. Klaus-Jörn Lange
    Some Results on Majority Quantifiers over Words. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:123-129 [Conf]
  13. Harry Buhrman, Leen Torenvliet
    Separating Complexity Classes Using Structural Properties. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:130-138 [Conf]
  14. Dániel Marx
    Parameterized Complexity of Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:139-149 [Conf]
  15. Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia
    Tight Lower Bounds for Certain Parameterized NP-Hard Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:150-160 [Conf]
  16. Venkatesan Guruswami, Daniele Micciancio, Oded Regev
    The Complexity of the Covering Radius Problem on Lattices and Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:161-173 [Conf]
  17. John M. Hitchcock, N. V. Vinodchandran
    Dimension, Entropy Rates, and Compression. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:174-183 [Conf]
  18. Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
    Properties of NP-Complete Sets. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:184-197 [Conf]
  19. John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran
    Partial Bi-immunity and NP-Completeness. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:198-203 [Conf]
  20. Vikraman Arvind, T. C. Vijayaraghavan
    Abelian Permutation Group Problems and Logspace Counting Classes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:204-214 [Conf]
  21. Ran Raz, Amir Shpilka
    Deterministic Polynomial Identity Testing in Non-Commutative Models. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:215-222 [Conf]
  22. Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
    Polynomials That Sign Represent Parity and Descartes Rule of Signs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:223-235 [Conf]
  23. Richard Cleve, Peter Høyer, Benjamin Toner, John Watrous
    Consequences and Limits of Nonlocal Strategies. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:236-249 [Conf]
  24. Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, Hein Röhrig
    Multiparty Quantum Coin Flipping. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:250-259 [Conf]
  25. Ran Raz, Amir Shpilka
    On the Power of Quantum Proofs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:260-274 [Conf]
  26. Chris Marriott, John Watrous
    Quantum Arthur-Merlin Games. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:275-285 [Conf]
  27. Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
    Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:286-293 [Conf]
  28. Sophie Laplante, Frédéric Magniez
    Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:294-304 [Conf]
  29. Andris Ambainis, Ke Yang
    Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:305-319 [Conf]
  30. Scott Aaronson
    Limitations of Quantum Advice and One-Way Communication. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:320-332 [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