Conferences in DBLP

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

1. Eric Allender
   The Complexity of Sparse Sets in P. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1986, pp:1-11 [Conf]
   
2. Eric Allender
   Isomorphisms and 1-L Reductions. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1986, pp:12-22 [Conf]
   
3. Klaus Ambos-Spies
   Randomness, Relativizations, and Polynomial Reducibilities. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1986, pp:23-34 [Conf]
   
4. José L. Balcázar, Josep Díaz, Joaquim Gabarró
   On Non- uniform Polynomial Space. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1986, pp:35-50 [Conf]
   
5. Ravi B. Boppana, J. C. Lagarias
   One- Way Functions and Circuit Complexity. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1986, pp:51-65 [Conf]
   
6. Jonathan F. Buss
   Relativized Alternation. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1986, pp:66-76 [Conf]
   
7. Samuel R. Buss
   The Polynomial Hierarchy and Intuitionistic Bounded Arithmetic. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1986, pp:77-103 [Conf]
   
8. Jin-yi Cai
   With Probability One, A Random Oracle Separates PSPACE from the Polynomial- Time Hierarchy. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1986, pp:104-104 [Conf]
   
9. Jin-yi Cai, Lane A. Hemachandra
   The Boolean Hierarchy: Hardware over NP. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1986, pp:105-124 [Conf]
   
10. Peter Clote, Gaisi Takeuti
    Exponential Time and Bounded Arithmetic. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:125-143 [Conf]
    
11. Anne Condon, Richard E. Ladner
    Probabilistic Game Automata. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:144-162 [Conf]
    
12. Martin Dietzfelbinger, Wolfgang Maass
    two Lower Bound Arguments with "Inaccessible" Numbers. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:163-183 [Conf]
    
13. Dung T. Huynh
    Resource- Bounded Kolmogorov Complexity of Hard Languages. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:184-195 [Conf]
    
14. Ker-I Ko, Timothy J. Long, Ding-Zhu Du
    A Note on One- Way Functions and Polynomial Time Isomorphisms. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:196-196 [Conf]
    
15. Ker-I Ko, Pekka Orponen, Uwe Schöning, Osamu Watanabe
    What Is a Hard Instance of a Computational Problem?. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:197-217 [Conf]
    
16. Mark W. Krentel
    The Complexity of Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:217-217 [Conf]
    
17. Ming Li, Luc Longpré, Paul M. B. Vitányi
    The Power of the Queue. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:218-233 [Conf]
    
18. James F. Lynch
    A Depth- Size Tradeoff for Boolean Circuits with Unbounded Fan- In. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:234-248 [Conf]
    
19. Wolfgang Maass, Georg Schnitger
    An Optimal Lower Bound for Turing Machines with One Work Tape and a Two- way Input Tape. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:249-264 [Conf]
    
20. Ken McAloon
    Separation Results for Bounded Alternation. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:265-271 [Conf]
    
21. Ian Parberry, Georg Schnitger
    Parallel Computation with Threshold Functions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:272-290 [Conf]
    
22. Kenneth W. Regan
    The Topology of Provability in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:291-310 [Conf]
    
23. David A. Russo
    Optimal Approximations of Complete Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:311-324 [Conf]
    
24. Michael Sipser
    Expanders, Randomness, or Time versus Space. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:325-329 [Conf]
    
25. Leen Torenvliet, Peter van Emde Boas
    Diagonalisation methods in a polynomial setting. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:330-346 [Conf]
    
26. Carol Tretkoff
    Bounded Oracles and Complexity Classes Inside Linear Space. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:347-361 [Conf]
    
27. Christopher B. Wilson
    Parallel Computation and the NC Hierarchy Relativized. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:362-382 [Conf]
    
28. Stathis Zachos
    Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:383-400 [Conf]