Uniformly hard languages

Authors:
Rod Downey;Lance Fortnow
Affiliations:
School of Mathematical and Computing Sciences, Victoria University, P. O. Box 600, Wellington, New Zealand;NEC Research Institute, 4 Independence Way, Princeton, NJ
Venue:
Theoretical Computer Science - Australasian computer science
Year:
2003

Citing 15
Cited 7

Separating the polynomial-time hierarchy by oracles

Proc. 26th annual symposium on Foundations of computer science
Minimal degrees for polynomial reducibilities

Journal of the ACM (JACM)
Minimal pairs for polynomial time reducibilities

Computation theory and logic
On the structure of intractable sets (binary relation)

On the structure of intractable sets (binary relation)
On the theory of the PTIME degrees of the recursive sets

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory

Theoretical Computer Science
Nondiamond theorems for polynomial time reducibility

Journal of Computer and System Sciences
Hardness vs randomness

Journal of Computer and System Sciences
BPP has subexponential time simulations unless EXPTIME has publishable proofs

Computational Complexity
P = BPP if E requires exponential circuits: derandomizing the XOR lemma

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the Structure of Polynomial Time Reducibility

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable

STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
On the Structure of Polynomial Time Degrees

STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
On Diagonalization Methods and the Structure of Language Classes

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory

Properties of uniformly hard languages

Information Processing Letters
The complexity of unions of disjoint sets

Journal of Computer and System Sciences
Properties of uniformly hard languages

Information Processing Letters
The complexity of unions of disjoint sets

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Robust simulations and significant separations

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
The birth and early years of parameterized complexity

The Multivariate Algorithmic Revolution and Beyond
Lower bounds on the complexity of MSO1 model-checking

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ladner (J. Assoc. Comput. Mach. 22 (1975) 155) showed that there are no minimal recursive sets under polynomial-time reductions. Given any recursive set A, Ladner constructs a set B such that B strictly reduces to A but B does not lie in P. The set B does have very long sequences of input lengths of easily computable instances.We examine whether Ladner's results hold if we restrict ourselves to "uniformly hard languages" which have no long sequences of easily computable instances. Under a hard to disprove assumption, we show that there exists a minimal recursive uniformly hard set under honest many-one polynomial-time reductions.