Conferences in DBLP

Conference on Computational Complexity / (coco)
1996 (conf/coco/96)

1. Manindra Agrawal, Eric Allender
   An Isomorphism Theorem for Circuit Complexity. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1996, pp:2-11 [Conf]
   
2. Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer
   Nondeterministic NC¹ Computation. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1996, pp:12-21 [Conf]
   
3. Kazuo Iwama, Chuzo Iwamoto
   Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1996, pp:24-32 [Conf]
   
4. Georg Gottlob
   Collapsing Oracle-Tape Hierarchies. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1996, pp:33-42 [Conf]
   
5. Noam Nisan
   Extracting Randomness: How and Why A survey. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1996, pp:44-58 [Conf]
   
6. Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik
   On Coherence, Random-self-reducibility, and Self-correction. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1996, pp:59-67 [Conf]
   
7. Uriel Feige, Oleg Verbitsky
   Error Reduction by Parallel Repetition - a Negative Result. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1996, pp:70-76 [Conf]
   
8. Marcus Schäfer
   Deciding the Vapnik-Cervonenkis dimension is Sigma^P₃-complete. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1996, pp:77-80 [Conf]
   
9. Pascal Koiran
   VC Dimension in Circuit Complexity. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1996, pp:81-85 [Conf]
   
10. Dieter van Melkebeek
    Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:88-96 [Conf]
    
11. Lance Fortnow, Judy Goldsmith, Stephen R. Mahaney
    L-Printable Sets. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:97-106 [Conf]
    
12. V. Vinay
    Hierarchies of Circuit Classes that are Closed under Complement. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:108-117 [Conf]
    
13. Helmut Veith
    Succinct Representation, Leaf Languages, and Projection Reductions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:118-126 [Conf]
    
14. Michael E. Saks
    Randomization and Derandomization in Space_Bounded Computation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:128-149 [Conf]
    
15. Ker-I Ko, Klaus Weihrauch
    On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:150-159 [Conf]
    
16. Clemens Lautemann, Thomas Schwentick, Iain A. Stewart
    On Positive P. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:162-170 [Conf]
    
17. Klaus Ambos-Spies, Elvira Mayordomo, Xizhong Zheng
    A Comparison of Weak Completeness Notions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:171-178 [Conf]
    
18. Yongge Wang
    The Law of the Iterated Logarithm for p-Random Sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:180-189 [Conf]
    
19. Rainer Schuler
    Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:190-195 [Conf]
    
20. Alan L. Selman
    Much Ado about Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:198-212 [Conf]
    
21. Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers
    Inverting Onto Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:213-222 [Conf]
    
22. Ashish V. Naik, Alan L. Selman
    A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:224-232 [Conf]
    
23. Samuel R. Buss, Toniann Pitassi
    Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:233-242 [Conf]
    
24. Christos H. Papadimitriou
    The Complexity of Knowledge Representation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:244-248 [Conf]
    
25. Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur
    Integer Programming as a Framework for Optimization and Approximability. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:249-259 [Conf]
    
26. Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
    Complements of Multivalued Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:260-269 [Conf]
    
27. Manindra Agrawal, Vikraman Arvind
    A Note on Decision versus Search for Graph Automorphism. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:272-277 [Conf]
    
28. Uriel Feige, Joe Kilian
    Zero Knowledge and the Chromatic Number. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:278-287 [Conf]
    
29. Eric Bach, Anne Condon, Elton Glaser, Celena Tanguay
    DNA Models and Algorithms for NP-complete Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:290-300 [Conf]
    
30. Ming Li, Paul M. B. Vitányi
    Reversible Simulation of Irreversible Computation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:301-306 [Conf]