Conferences in DBLP

Conference on Computational Complexity / (coco)
1997 (conf/coco/97)

1. Harry Buhrman, Lance Fortnow, Leen Torenvliet
   Six Hypotheses in Search of a Theorem. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1997, pp:2-12 [Conf]
   
2. Daniel Hammer, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin
   Inequalities for Shannon entropies and Kolmogorov complexities. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1997, pp:13-23 [Conf]
   
3. Richard Beigel, Bin Fu
   Circuits Over PP and PL. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1997, pp:24-35 [Conf]
   
4. Bernd Borchert, Riccardo Silvestri
   The General Notion of a Dot-Operator. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1997, pp:36-44 [Conf]
   
5. Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp
   Reversible Space Equals Deterministic Space. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1997, pp:45-50 [Conf]
   
6. Lance Fortnow
   Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1997, pp:52-60 [Conf]
   
7. Kenneth W. Regan
   Polynomial Vicinity Circuits and Nonlinear Lower Bounds. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1997, pp:61-68 [Conf]
   
8. Rainer Schuler
   A Note on Universal Distributions for Polynomial-Time Computable Distributions. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1997, pp:69-73 [Conf]
   
9. Christoph Karg
   LR(k) Testing is Average Case Complete. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 1997, pp:74-80 [Conf]
   
10. Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov
    Complexity and Expressive Power of Logic Programming. [Citation Graph (2, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:82-101 [Conf]
    
11. Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer
    Hyper-Polynomial Hierarchies and the NP-Jump. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:102-110 [Conf]
    
12. Jack H. Lutz, Yong Zhao
    The Density of Weakly Complete Problems under Adaptive Reductions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:111-120 [Conf]
    
13. Klaus Ambos-Spies, Levke Bentzien
    Separating NP-Completeness Notions under Strong Hypotheses. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:121-127 [Conf]
    
14. Rodney G. Downey, André Nies
    Undecidability Results for Low Complexity Degree Structures. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:128-132 [Conf]
    
15. Manindra Agrawal, Eric Allender, Samir Datta
    On TC⁰, AC⁰, and Arithmetic Circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:134-148 [Conf]
    
16. Richard Beigel, Alexis Maciel
    Upper and Lower Bounds for Some Depth-3 Circuit Classes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:149-157 [Conf]
    
17. Liming Cai, Jianer Chen, Johan Håstad
    Circuit Bottom Fan-in and Computational Power. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:158-164 [Conf]
    
18. Christer Berg, Staffan Ulfberg
    A Lower Bound for Perceptrons and an Oracle Separation of the PP^PH Hierarchy. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:165-172 [Conf]
    
19. Heribert Vollmer, Klaus W. Wagner
    On Operators of Higher Types. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:174-184 [Conf]
    
20. Maren Hinrichs, Gerd Wechsung
    Time Bounded Frequency Computations. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:185-192 [Conf]
    
21. Joshua Berman, Arthur Drisko, François Lemieux, Cristopher Moore, Denis Thérien
    Circuits and Expressions with NOn-Associative Gates. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:193-203 [Conf]
    
22. Vikraman Arvind, Jacobo Torán
    A Nonadaptive NC Checker for Permutation Group Intersection. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:204-212 [Conf]
    
23. Ulrich Hertrampf
    Acceptance by Transformation Monoids (with an Application to Local Self Reductions). [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:213-224 [Conf]
    
24. Allan Borodin, Ran El-Yaniv
    On Ranomization in Online Computation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:226-238 [Conf]
    
25. László Babai, Peter G. Kimmel
    Randomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:239-246 [Conf]
    
26. Gábor Tardos, Uri Zwick
    The Communication Complexity of the Universal Relation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:247-259 [Conf]
    
27. Pierluigi Crescenzi
    A Short Guide to Approximation Preserving Reductions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:262-273 [Conf]
    
28. Jianer Chen, Donald K. Friesen, Hao Zheng
    Tight Bound on Johnson's Algoritihm for Max-SAT. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:274-281 [Conf]
    
29. Sanjeev Khanna, Madhu Sudan, Luca Trevisan
    Constraint Satisfaction: The Approximability of Minimization Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:282-296 [Conf]
    
30. Janos Simon, Shi-Chun Tsai
    A Note on the Bottleneck Counting Argument. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:297-301 [Conf]
    
31. Stasys Jukna
    Finite Limits and Monotone Computations: The Lower Bounds Criterion. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:302-313 [Conf]