SIGACT news complexity theory column 40
ACM SIGACT News
Bi-immunity separates strong NP-completeness notions
Information and Computation
Reductions between disjoint NP-pairs
Information and Computation
Comparing reductions to NP-complete sets
Information and Computation
Autoreducibility, mitoticity, and immunity
Journal of Computer and System Sciences
Query-monotonic Turing reductions
Theoretical Computer Science
Upward separations and weaker hypotheses in resource-bounded measure
Theoretical Computer Science
Theoretical Computer Science
Reductions between disjoint NP-Pairs
Information and Computation
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Computational complexity of the quantum separability problem
Quantum Information & Computation
Query-monotonic turing reductions
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Comparing reductions to NP-complete sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Autoreducibility, mitoticity, and immunity
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Hardness hypotheses, derandomization, and circuit complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
A thirty year old conjecture about promise problems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is $\mbox{${\leq}^{\rm P}_{\rm T}$}$-complete but not $\mbox{${\leq}^{\rm P}_{tt}$}$-complete. We provide fairly thorough analyses of the hypotheses that we introduce.