The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Conferences in DBLP

Conference on Computational Complexity / (coco)
1993 (conf/coco/93)

  1. Jin-yi Cai, Richard J. Lipton, Robert Sedgewick, Andrew Chi-Chih Yao
    Towards Uncheatable benchmarks. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:2-11 [Conf]
  2. Christos H. Papadimitriou, Mihalis Yannakakis
    On Limited Nondeterminism and the Complexity of the V.C Dimension (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:12-18 [Conf]
  3. Ronald Fagin, Larry J. Stockmeyer, Moshe Y. Vardi
    On Monadic NP vs. Monadic co-NP (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:19-30 [Conf]
  4. Phokion G. Kolaitis, Madhukar N. Thakur
    Polynomial-time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:31-41 [Conf]
  5. Harry Buhrman, Peter van Helden, Leen Torenvliet
    P-Selective Self-reducibles Sets: A New Characterization of P. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:44-51 [Conf]
  6. Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman
    P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:52-64 [Conf]
  7. Jay Belanger, Jie Wang
    Isomorphisms of NP Complete Problems on Random Instances. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:65-74 [Conf]
  8. Manindra Agrawal, Somenath Biswas
    Polynomial Isomorphism of 1-L-Complete Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:75-80 [Conf]
  9. Richard Beigel
    The Polynomial Method in Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:82-95 [Conf]
  10. Shi-Chun Tsai
    Lower Bounds on Representing Boolean Functions as Polynomials in Zm. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:96-101 [Conf]
  11. Mauricio Karchmer, Avi Wigderson
    On Span Programs. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:102-111 [Conf]
  12. Mauricio Karchmer
    On Proving Lower Bounds for Circuit Size. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:112-118 [Conf]
  13. Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li
    An Oarcle Builder's Toolkit. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:120-131 [Conf]
  14. Nikolai K. Vereshchagin
    Relationships between NP-sets, Co-NP-sets, and P-sets relative to random oracles. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:132-138 [Conf]
  15. Mitsunori Ogiwara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
    On Closure Properties of #P in the Context of PF°#P. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:139-146 [Conf]
  16. Johannes Köbler, Seinosuke Toda
    On the Power of Generalized MOD-Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:147-155 [Conf]
  17. Jack H. Lutz
    The Quantitative Structure of Exponential Time. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:158-175 [Conf]
  18. Suresh Chari, Pankaj Rohatgi
    On Completeness under Random Reductions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:176-184 [Conf]
  19. Bin Fu
    With Quasi-linear Queries, EXP is not Polynomial Time Turing Reducible to ?Sparse Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:185-191 [Conf]
  20. Pierluigi Crescenzi, Riccardo Silvestri
    Sperner's Lemma and Robust Machines. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:194-199 [Conf]
  21. Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner
    On the Power of Polynomial Time Bit-Reductions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:200-207 [Conf]
  22. Harry Buhrman, Luc Longpré, Edith Spaan
    SPARSE reduces conjunctively to TALLY. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:208-214 [Conf]
  23. Sanjeev Saluja
    Relativized limitations of left set technique and closure classes of sparse sets (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:215-222 [Conf]
  24. Klaus-Jörn Lange
    Complexity and Structure in Formal Language Theory. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:224-238 [Conf]
  25. Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
    Pointers versus Arithmetic in PRAMs. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:239-252 [Conf]
  26. José L. Balcázar, Ricard Gavaldà, Hava T. Siegelmann, Eduardo D. Sontag
    Some Structural Complexity Aspects of Neural Computation. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:253-265 [Conf]
  27. Sanjay Gupta
    Alternating Time Versus Deterministic Time: A Separation. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:266-277 [Conf]
  28. Birgit Jenner, Jacobo Torán
    Computing Functions with Parallel Queries to NP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:280-291 [Conf]
  29. Tirza Hirst, David Harel
    Taking it to the Limit: On Infinite Variants of NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:292-304 [Conf]
  30. David Zuckerman
    NP-Complete Problems Have a Version That's Hard to Approximate. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:305-312 [Conf]
  31. Zhi-Zhong Chen, Seinosuke Toda
    The Complexity of Selecting Maximal Solutions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:313-325 [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002