Conferences in DBLP

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

1. 
   Parallel Repetition of Two Prover Games (Invited Survey). [Citation Graph (, )][DBLP]
   
   
2. 
   No Strong Parallel Repetition with Entangled and Non-signaling Provers. [Citation Graph (, )][DBLP]
   
   
3. 
   Derandomized Parallel Repetition of Structured PCPs. [Citation Graph (, )][DBLP]
   
   
4. 
   Derandomized Parallel Repetition Theorems for Free Games. [Citation Graph (, )][DBLP]
   
   
5. 
   Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. [Citation Graph (, )][DBLP]
   
   
6. 
   Simple Affine Extractors Using Dimension Expansion. [Citation Graph (, )][DBLP]
   
   
7. 
   Derandomizing from Random Strings. [Citation Graph (, )][DBLP]
   
   
8. 
   On the Power of Randomized Reductions and the Checkability of SAT. [Citation Graph (, )][DBLP]
   
   
9. 
   A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. [Citation Graph (, )][DBLP]
   
   
10. 
    The Program-Enumeration Bottleneck in Average-Case Complexity Theory. [Citation Graph (, )][DBLP]
    
    
11. 
    On the Unique Games Conjecture (Invited Survey). [Citation Graph (, )][DBLP]
    
    
12. 
    Spectral Algorithms for Unique Games. [Citation Graph (, )][DBLP]
    
    
13. 
    A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. [Citation Graph (, )][DBLP]
    
    
14. 
    On the Matching Problem for Special Graph Classes. [Citation Graph (, )][DBLP]
    
    
15. 
    On the Relative Strength of Pebbling and Resolution. [Citation Graph (, )][DBLP]
    
    
16. 
    Trade-Off Lower Bounds for Stack Machines. [Citation Graph (, )][DBLP]
    
    
17. 
    Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. [Citation Graph (, )][DBLP]
    
    
18. 
    Completely Inapproximable Monotone and Antimonotone Parameterized Problems. [Citation Graph (, )][DBLP]
    
    
19. 
    The Learning with Errors Problem (Invited Survey). [Citation Graph (, )][DBLP]
    
    
20. 
    The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions. [Citation Graph (, )][DBLP]
    
    
21. 
    A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions. [Citation Graph (, )][DBLP]
    
    
22. 
    Fooling Functions of Halfspaces under Product Distributions. [Citation Graph (, )][DBLP]
    
    
23. 
    Lower Bounds for Testing Function Isomorphism. [Citation Graph (, )][DBLP]
    
    
24. 
    The Partition Bound for Classical Communication Complexity and Query Complexity. [Citation Graph (, )][DBLP]
    
    
25. 
    Communication Complexity with Synchronized Clocks. [Citation Graph (, )][DBLP]
    
    
26. 
    Exact Threshold Circuits. [Citation Graph (, )][DBLP]
    
    
27. 
    Relationless Completeness and Separations. [Citation Graph (, )][DBLP]
    
    
28. 
    On Matrix Rigidity and Locally Self-Correctable Codes. [Citation Graph (, )][DBLP]