Iannis Tourlakis Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:22-0 [Conf]

Gabriel Istrate Computational Complexity and Phase Transitions. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:104-115 [Conf]

Oliver Kullmann An Application of Matroid Theory to the SAT Problem. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:116-0 [Conf]

Luca Trevisan A Survey of Optimal PCP Characterizations of NP. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:146-0 [Conf]

Valentine Kabanets Easiness Assumptions and Hardness Tests: Trading Time for Zero Error. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:150-157 [Conf]

Jack H. Lutz Dimension in Complexity Classes. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:158-169 [Conf]

Marcus Schaefer Deciding the K-Dimension is PSPACE-Complete. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:198-203 [Conf]

Ke Yang Integer Circuit Evaluation is PSPACE-Complete. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:204-0 [Conf]

Andrei A. Voronenko On the Complexity of the Monotonicity Verification. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:235-238 [Conf]

Paul M. B. Vitányi Three Approaches to the Quantitative Definition of Information in an Individual Pure Quantum State. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:263-270 [Conf]

Ronald de Wolf Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:271-278 [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