Conferences in DBLP

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

1. 
   Preface. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2006, pp:- [Conf]
   
2. 
   Committees. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2006, pp:- [Conf]
   
3. 
   Awards. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2006, pp:- [Conf]
   
4. 
   Reviewers. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2006, pp:- [Conf]
   
5. Pavel Pudlák
   Godel and Computations (Abstract). [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2006, pp:3-5 [Conf]
   
6. Neeraj Kayal, Nitin Saxena
   Polynomial Identity Testing for Depth 3 Circuits. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2006, pp:9-17 [Conf]
   
7. Rocco A. Servedio
   Every Linear Threshold Function has a Low-Weight Approximator. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2006, pp:18-32 [Conf]
   
8. Amir Shpilka
   Constructions of Low-Degree and Error-Correcting in-Biased Generators. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2006, pp:33-45 [Conf]
   
9. Ronen Shaltiel
   How to Get More Mileage from Randomness Extractors. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2006, pp:46-60 [Conf]
   
10. Marius Zimand
    Exposure-Resilient Extractors. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:61-72 [Conf]
    
11. Joshua Buresh-Oppenheim, Rahul Santhanam
    Making Hard Problems Harder. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:73-87 [Conf]
    
12. Albert Atserias
    Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:88-95 [Conf]
    
13. Rafael Pass
    Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:96-110 [Conf]
    
14. Avi Wigderson
    Applications of the Sum-Product Theorem in Finite Fields. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:111- [Conf]
    
15. Parikshit Gopalan
    Constructing Ramsey Graphs from Boolean Function Representations. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:115-128 [Conf]
    
16. Dieter van Melkebeek, Konstantin Pervyshev
    A Generic Time Hierarchy for Semantic Models with One Bit of Advice. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:129-144 [Conf]
    
17. Ishay Haviv, Oded Regev
    Hardness of the Covering Radius Problem on Lattices. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:145-158 [Conf]
    
18. Subhash Khot, Rishi Saket
    A 3-Query Non-Adaptive PCP with Perfect Completeness. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:159-169 [Conf]
    
19. Iannis Tourlakis
    New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:170-182 [Conf]
    
20. Christoph Behle, Klaus-Jörn Lange
    FO[<]-Uniformity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:183-189 [Conf]
    
21. Michal Koucký, Clemens Lautemann, Sebastian Poloczek, Denis Thérien
    Circuit Lower Bounds via Ehrenfeucht-Fraisse Games. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:190-201 [Conf]
    
22. Kristoffer Arnsfelt Hansen
    On Modular Counting with Polynomials. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:202-212 [Conf]
    
23. Ryan O'Donnell, Rocco A. Servedio
    Learning Monotone Decision Trees in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:213-225 [Conf]
    
24. Vitaly Feldman
    Optimal Hardness Results for Maximizing Agreements with Monomials. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:226-236 [Conf]
    
25. Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks
    Minimizing DNF Formulas and AC⁰_d Circuits Given a Truth Table. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:237-251 [Conf]
    
26. Chris Calabro, Russell Impagliazzo, Ramamohan Paturi
    A Duality between Clause Width and Clause Density for SAT. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:252-260 [Conf]
    
27. Scott Aaronson
    QMA/qpoly \subseteq PSPACE/poly: De-Merlinizing Quantum Protocols. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:261-273 [Conf]
    
28. Pranab Sen
    Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:274-287 [Conf]
    
29. Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
    Strengths and Weaknesses of Quantum Fingerprinting. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:288-298 [Conf]
    
30. Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
    Grid Graph Reachability Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:299-313 [Conf]
    
31. Yijia Chen, Martin Grohe
    An Isomorphism between Subexponential and Parameterized Complexity Theory. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:314-330 [Conf]
    
32. Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
    On the Complexity of Numerical Analysis. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:331-339 [Conf]
    
33. Scott Aaronson
    Oracles Are Subtle But Not Malicious. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:340-354 [Conf]
    
34. H. Venkateswaran
    Derandomization of Probabilistic Auxiliary Pushdown Automata Classes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:355-370 [Conf]