Conferences in DBLP

Conference on Computational Complexity / (coco)
1989 (conf/coco/89)

1. Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer
   The Isomorphism Conjecture Fails Relative to a Random Oracle (abstract). [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1989, pp:2- [Conf]
   
2. Steven Homer, Alan L. Selman
   Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1989, pp:3-14 [Conf]
   
3. Osamu Watanabe, Shouwen Tang
   On Polynomial Time Turing and Many-One Completeness in PSPACE. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1989, pp:15-23 [Conf]
   
4. Jie Wang
   P-Creative Sets vs. P-Completely Creative Sets. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1989, pp:24-33 [Conf]
   
5. Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby
   On the Theory of Average Case Complexity (abstract). [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1989, pp:36- [Conf]
   
6. Jack H. Lutz
   Almost Everywhere High Nonuniform Complexity. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1989, pp:37-53 [Conf]
   
7. Noam Nisan
   Hardness vs. Randomness - A Survey (abstract). [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1989, pp:54- [Conf]
   
8. Peter Clote
   Boolean Functions, Invariance Groups and Parallel Complexity. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1989, pp:55-66 [Conf]
   
9. Richard A. Shore, Theodore A. Slaman
   The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier Theory. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1989, pp:68-76 [Conf]
   
10. Yves Marcoux
    Composition is Almost as Good as S-1-1. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:77-86 [Conf]
    
11. Kenneth W. Regan
    Finitary Substructure Languages. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:87-96 [Conf]
    
12. Jerry L. Trahan, Michael C. Loui, Vijaya Ramachandran
    The Power of Parallel Random Access Machines with Augmented Instruction Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:97-103 [Conf]
    
13. Neil Immerman, Susan Landau
    The Complexity of Iterated Multiplication. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:104-111 [Conf]
    
14. Ernst W. Mayr, Ashok Subramanian
    The Complexity of Circuit Value and Network Stability. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:114-123 [Conf]
    
15. Christopher B. Wilson
    Decomposing NC and AC. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:124-131 [Conf]
    
16. Mark W. Krentel
    On Finding Locally Optimal Solutions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:132-137 [Conf]
    
17. Jin-yi Cai, Juris Hartmanis
    The Complexity Of The Real Line Is A Fractal. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:138-146 [Conf]
    
18. Tak Wah Lam, Walter L. Ruzzo
    Results on Communication Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:148-157 [Conf]
    
19. Uriel Feige, Adi Shamir
    Multi-Oracle Interactive Protocols with Space Bounded Verifiers. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:158-164 [Conf]
    
20. Ming Li, Paul M. B. Vitányi
    Inductive Reasoning and Komogorov Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:165-185 [Conf]
    
21. Eric Allender
    The Generalized Kolmogorov Complexity of Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:186-194 [Conf]
    
22. Rodney G. Downey, Steven Homer, William I. Gasarch, Michael Moses
    On Honest Polynomial Reductions, Relativizations, and P=NP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:196-207 [Conf]
    
23. Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán
    Turing Machines with few Accepting Computations and low Sets for PP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:208-215 [Conf]
    
24. Richard Beigel
    On the Relativized Power of Additional Accepting Paths. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:216-224 [Conf]
    
25. Richard Beigel, Lane A. Hemachandra, Gerd Wechsung
    On the Power of Probabilistic Polynomial Time: P^NP[log] subseteq PP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:225-227 [Conf]
    
26. Leonard Pitt, Manfred K. Warmuth
    The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial (abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:230- [Conf]
    
27. Wolfgang Maass, Theodore A. Slaman
    The Complexity Types of Computable Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:231-239 [Conf]
    
28. Matthias Krause, Christoph Meinel, Stephan Waack
    Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:240-249 [Conf]
    
29. Richard Chang
    On the Structure of Bounded Queries to Arbitrary NP Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:250-258 [Conf]
    
30. José L. Balcázar
    Nondeterministic Witnesses and Nonuniform Advice. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:259-269 [Conf]