The SCEAS System
Navigation Menu

Conferences in DBLP

Conference on Computational Complexity / (coco)
1995 (conf/coco/95)

  1. Kousha Etessami
    Counting Quantifiers, Successor Relations, and Logarithmic Space. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:2-11 [Conf]
  2. Marius Zimand
    Weighted NP Optimization Problems: Logical Definability and Approximation Properties. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:12-28 [Conf]
  3. Kazuo Iwama, Eiji Miyano
    Intractability of Read-Once Resolution. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:29-36 [Conf]
  4. James S. Royer
    Semantics versus Syntax versus Computations. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:37-48 [Conf]
  5. Kenneth W. Regan
    On Superlinear Lower Bounds in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:50-64 [Conf]
  6. Anna Gál, Mario Szegedy
    Fault Tolerant Circuits and Probabilistically Checkable Proofs. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:65-73 [Conf]
  7. Yosi Ben-Asher, Ilan Newman
    Decision Trees with AND, OR Queries. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:74-81 [Conf]
  8. Anna Gál
    Semi-Unbounded Fan-In Circuits: Boolean vs. Arithmetic. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:82-87 [Conf]
  9. John D. Rogers
    The Isomorphism Conjecture Holds and One-Way Functions Exist Relative to an Oracle. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:90-101 [Conf]
  10. Stephen A. Fenner
    Inverting the Turing Jump in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:102-110 [Conf]
  11. Martin Kummer
    The Instance Complexity Conjecture. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:111-124 [Conf]
  12. Richard Beigel, William I. Gasarch, Efim B. Kinber
    Frequency Computation and Bounded Queries. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:125-132 [Conf]
  13. Russell Impagliazzo
    A Personal View of Average-Case Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:134-147 [Conf]
  14. Rainer Schuler, Osamu Watanabe
    Towards Average-Case Complexity Analysis of NP Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:148-159 [Conf]
  15. Klaus Ambos-Spies
    Resource-Bounded Genericity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:162-181 [Conf]
  16. Stephen A. Fenner
    Resource-Bounded Baire Category: A Stronger Approach. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:182-192 [Conf]
  17. José L. Balcázar, Elvira Mayordomo
    A Note on Genericity and Bi-Immunity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:193-196 [Conf]
  18. Harry Buhrman, Elvira Mayordomo
    An Excursion to the Kolmogorov Random Strings. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:197-203 [Conf]
  19. Yenjo Han, Thomas Thierauf
    Restricted Information from Nonadaptive Queries to NP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:206-213 [Conf]
  20. Sameet Agarwal, Anne Condon
    On Approximation Algorithms for Hierarchical MAX-SAT. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:214-226 [Conf]
  21. Joan Feigenbaum, Daphne Koller, Peter W. Shor
    A Game-Theoretic Classification of Interactive Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:227-237 [Conf]
  22. Chih-Long Lin
    Optimizing TRIEs for Ordered Pattern Matching is PiP2-Complete. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:238-244 [Conf]
  23. Johannes Köbler
    On the Structure of Low Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:246-261 [Conf]
  24. Nicholas Q. Trân
    On P-Immunity of Nondeterministic Complete Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:262-263 [Conf]
  25. Manindra Agrawal, Vikraman Arvind
    Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:264-276 [Conf]
  26. Richard Beigel, Howard Straubing
    The Power of Local Self-Reductions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:277-285 [Conf]
  27. Richard Chang, William I. Gasarch, Jacobo Torán
    On Finding the Number of Graph Automorphisms. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:288-298 [Conf]
  28. Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
    On the Power of Number-Theoretic Operations with Respect to Counting. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:299-314 [Conf]
  29. Manindra Agrawal
    DSPACE(n)=?NSPACE(n): A Degree Theoretic Characterization. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:315-323 [Conf]
  30. Jack H. Lutz
    A Small Span Theorem for P/Poly-Turing Reductions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:324-330 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002