Conferences in DBLP

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

1. Eli Ben-Sasson, Avi Wigderson
   Short Proofs Are Narrow - Resolution Made Simple (Abstract). [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1999, pp:2- [Conf]
   
2. J. Maurice Rojas
   On the Complexity of Diophantine Geometry in Low Dimensions (Abstract). [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1999, pp:3- [Conf]
   
3. Madhu Sudan, Luca Trevisan, Salil P. Vadhan
   Pseudorandom Generators without the XOR Lemma (Abstract). [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1999, pp:4- [Conf]
   
4. Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi
   Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract). [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1999, pp:5- [Conf]
   
5. Marcus Schaefer
   Graph Ramsey Theory and the Polynomial Hierarchy (Abstract). [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1999, pp:6- [Conf]
   
6. Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh
   The Communication Complexity of Pointer Chasing Applications of Entropy and Sampling (Abstract). [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1999, pp:7- [Conf]
   
7. Eric Allender, Michael E. Saks, Igor Shparlinski
   A Lower Bound for Primality. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1999, pp:10-14 [Conf]
   
8. Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi
   Non-Automatizability of Bounded-Depth Frege Proofs. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1999, pp:15-23 [Conf]
   
9. David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum
   On Monotone Planar Circuits. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1999, pp:24-0 [Conf]
   
10. Anna Gál, Shai Halevi, Richard J. Lipton, Erez Petrank
    Computing from Partial Solutions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:34-45 [Conf]
    
11. Ravi Kumar, D. Sivakumar
    Proofs, Codes, and Polynomial-Time Reducibilities. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:46-53 [Conf]
    
12. Oded Goldreich, Salil P. Vadhan
    Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:54-0 [Conf]
    
13. Avi Wigderson
    De-Randomizing BPP: The State of the Art. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:76-0 [Conf]
    
14. Mikael Goldmann, Alexander Russell
    The Complexity of Solving Equations over Finite Groups. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:80-86 [Conf]
    
15. Amir Shpilka, Avi Wigderson
    Depth-3 Arithmetic Formulae over Fields of Characteristic Zero. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:87-0 [Conf]
    
16. László Babai, Sophie Laplante
    Stronger Separations for Random-Self-Reducibility, Rounds, and Advice. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:98-104 [Conf]
    
17. Tao Jiang, Ming Li, Paul M. B. Vitányi
    The Expected Size of Heilbronn's Triangles. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:105-113 [Conf]
    
18. Andrei A. Muchnik, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin
    Upper Semilattice of Binary Strings with the Relation "x is Simple Conditional to y". [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:114-0 [Conf]
    
19. Richard Beigel
    Gaps in Bounded Query Hierarchies. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:124-141 [Conf]
    
20. Jack Jie Dai, Jack H. Lutz
    Query Order and NP-Completeness. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:142-148 [Conf]
    
21. Harry Buhrman, Wim van Dam
    Quantum Bounded Query Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:149-0 [Conf]
    
22. Jin-yi Cai
    Some Recent Progress on the Complexity of Lattice Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:158-0 [Conf]
    
23. John Watrous
    Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:180-187 [Conf]
    
24. Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson
    Deterministic Amplification of Space-Bounded Probabilistic Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:188-0 [Conf]
    
25. Ravi Kumar, D. Sivakumar
    A Note on the Shortest Lattice Vector Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:200-204 [Conf]
    
26. Jin-yi Cai
    Applications of a New Transference Theorem to Ajtai's Connection Factor. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:205-214 [Conf]
    
27. Jun Tarui, Tatsuie Tsukiji
    Learning DNF by Approximating Inclusion-Exclusion Formulae. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:215-0 [Conf]
    
28. Richard Beigel, Alexis Maciel
    Circuit Lower Bounds Collapse Relativized Complexity Classes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:222-226 [Conf]
    
29. Harry Buhrman, Leen Torenvliet
    Complicated Complementations. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:227-236 [Conf]
    
30. Russell Impagliazzo, Ramamohan Paturi
    Complexity of k-SAT. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:237-240 [Conf]