Conferences in DBLP
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 ] 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 ] Hoeteck Wee On Pseudoentropy versus Compressibility. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2004, pp:29-41 [Conf ] 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 ] 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 ] 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 ] 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 ] 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 ] Vikraman Arvind , Jacobo Torán Solvable Group Isomorphism. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2004, pp:91-103 [Conf ] John M. Hitchcock Small Spans in Scaled Dimension. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2004, pp:104-112 [Conf ] Ilan Newman Computing in Fault Tolerance Broadcast Networks. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2004, pp:113-122 [Conf ] 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 ] 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 ] Dániel Marx Parameterized Complexity of Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2004, pp:139-149 [Conf ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Chris Marriott , John Watrous Quantum Arthur-Merlin Games. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2004, pp:275-285 [Conf ] 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 ] 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 ] 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 ] 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 ]