Conferences in DBLP

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

1. Ryan O'Donnell, Rocco A. Servedio
   Extremal properties of polynomial threshold functions. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2003, pp:3-12 [Conf]
   
2. Yijia Chen, Jörg Flum, Martin Grohe
   Bounded Nondeterminism and Alternation in Parameterized Complexity Theory. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2003, pp:13-29 [Conf]
   
3. Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
   Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2003, pp:33-47 [Conf]
   
4. Russell Impagliazzo, Philippe Moser
   A zero one law for RP. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2003, pp:48-52 [Conf]
   
5. Emanuele Viola
   Hardness vs. Randomness within Alternating Time. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2003, pp:53-0 [Conf]
   
6. Pranab Sen
   Lower bounds for predecessor searching in the cell probe model. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2003, pp:73-83 [Conf]
   
7. Detlef Sieling
   Minimization of Decision Trees Is Hard to Approximate. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2003, pp:84-92 [Conf]
   
8. Navin Goyal, Michael E. Saks, Srinivasan Venkatesh
   Optimal Separation of EROW and CROWPRAMs. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2003, pp:93-0 [Conf]
   
9. Amit Chakrabarti, Subhash Khot, Xiaodong Sun
   Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2003, pp:107-117 [Conf]
   
10. Hartmut Klauck
    Rectangle Size Bounds and Threshold Covers in Communication Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:118-134 [Conf]
    
11. Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi
    The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:135-0 [Conf]
    
12. Scott Aaronson
    Quantum Certificate Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:171-178 [Conf]
    
13. Howard Barnum, Michael E. Saks, Mario Szegedy
    Quantum query complexity and semi-definite programming. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:179-193 [Conf]
    
14. Ke Yang, Avrim Blum
    On Statistical Query Sampling and NMR Quantum Computing. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:194-0 [Conf]
    
15. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy
    Derandomization and Distinguishing Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:209-220 [Conf]
    
16. Andrei E. Romashchenko
    Extracting the Mutual Information for a Triple of Binary Strings. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:221-229 [Conf]
    
17. Wolfgang Merkle
    The complexity of stochastic sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:230-0 [Conf]
    
18. Albert Atserias, Víctor Dalmau
    A Combinatorial Characterization of ResolutionWidth. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:239-247 [Conf]
    
19. Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind
    Memoization and DPLL: Formula Caching Proof Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:248-0 [Conf]
    
20. Johan Håstad
    Inapproximability Some history and some open problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:265-0 [Conf]
    
21. Rahul Santhanam, Dieter van Melkebeek
    Holographic Proofs and Derandomization. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:269-283 [Conf]
    
22. Lars Engebretsen, Jonas Holmerin
    Three-Query PCPs with Perfect Completeness over non-Boolean Domains. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:284-299 [Conf]
    
23. Venkatesan Guruswami
    List Decoding with Side Information. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:300-0 [Conf]
    
24. Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
    Disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:313-332 [Conf]
    
25. Richard Beigel, Lance Fortnow
    Are Cook and Karp Ever the Same? [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:333-336 [Conf]
    
26. Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel
    Universal Languages and the Power of Diagonalization. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:337-346 [Conf]
    
27. Lance Fortnow, Aduri Pavan, Samik Sengupta
    Proving SAT does not have Small Circuits with an Application to the Two. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:347-0 [Conf]
    
28. Manindra Agrawal
    On Derandomizing Tests for Certain Polynomial Identities. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:355-0 [Conf]
    
29. Oded Regev
    Improved Inapproximability of Lattice and Coding Problems with Preprocessing. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:363-370 [Conf]
    
30. Jonas Holmerin, Subhash Khot
    A Strong Inapproximability Gap for a Generalization of Minimum Bisection. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:371-378 [Conf]
    
31. Subhash Khot, Oded Regev
    Vertex Cover Might be Hard to Approximate to within 2-\varepsilon. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:379-0 [Conf]