Diagonalizations over polynomial time computable sets
Theoretical Computer Science
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
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
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)
Pseudo-Random Generators and Structure of Complete Degrees
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
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
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Autoreducibility, mitoticity, and immunity
Journal of Computer and System Sciences
Theoretical Computer Science
Query-monotonic Turing reductions
Theoretical Computer Science
COLT'07 Proceedings of the 20th annual conference on Learning theory
Splitting of learnable classes
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Mitosis in computational complexity
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Machines that can output empty words
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
We show the following results regarding complete sets.NP-complete sets and PSPACE-complete sets are many-one autoreducible. Complete sets of any level of PH, MODPH, or the Boolean hierarchy over NP are many-one autoreducible. EXP-complete sets are many-one mitotic. NEXP-complete sets are weakly many-one mitotic. PSPACE-complete sets are weakly Turing-mitotic. If one-way permutations and quick pseudo-random generators exist, then NP-complete languages are m-mitotic. If there is a tally language in NP ∩ coNP - P, then, for every ε 0, NP-complete sets are not 2n(1+ε)-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.