Diagonalizations over polynomial time computable sets
Theoretical Computer Science
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Probalisitic complexity classes and lowness
Journal of Computer and System Sciences
Coherent functions and program checkers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On polynomial-time bounded truth-table reducibility of NP sets to sparse sets
SIAM Journal on Computing
Counting classes: thresholds, parity, mods, and fewness
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
Complete problems and strong polynomial reducibilities
SIAM Journal on Computing
Exponential-time and subexponential-time sets
Theoretical Computer Science
On being incoherent without being very hard
Computational Complexity
The Complexity and Distribution of Hard Problems
SIAM Journal on Computing
Genericity and measure for exponential time
MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
Splittings, Robustness, and Structure of Complete Sets
SIAM Journal on Computing
Separating Complexity Classes Using Autoreducibility
SIAM Journal on Computing
Computability and complexity theory
Computability and complexity theory
Separation of NP-Completeness Notions
SIAM Journal on Computing
Nondeterministic Turing Machines with Modified Acceptance
Mathematical Foundations of Computer Science 1986
Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
On P-immunity of nondeterministic complete sets
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
A note on genericity and bi-immunity
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Polynomial reducibilities and complete sets.
Polynomial reducibilities and complete sets.
The cpa's responsibility for the prevention and detection of computer fraud.
The cpa's responsibility for the prevention and detection of computer fraud.
Separating Complexity Classes Using Structural Properties
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Properties of NP-Complete Sets
SIAM Journal on Computing
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Autoreducibility, mitoticity, and immunity
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
The dot-depth and the polynomial hierarchy correspond on the delta levels
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
SIGACT news complexity theory column 64
ACM SIGACT News
Autoreducibility of complete sets for log-space and polynomial-time reductions
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We show the following results regarding complete sets.*NP-complete sets and PSPACE-complete sets are polynomial-time many-one autoreducible. *Complete sets of any level of PH, MODPH, or the Boolean hierarchy over NP are polynomial-time many-one autoreducible. *EXP-complete sets are polynomial-time many-one mitotic. *If there is a tally language in NP@?coNP-P, then, for every @e0, NP-complete sets are not 2^n^(^1^+^@e^)-immune. These results solve several of the open questions raised by Buhrman and Torenvliet in their 1994 survey paper on the structure of complete sets.