Hard-core theorems for complexity classes

Authors:
Shimon Even;Alan L. Selmen;Yacov Yacobi
Affiliations:
Computer Science Department, Technion, Haifa, Israel;Computer Science Department, Iowa State University, Ames, Iowa;Electrical Engineering Department, Technion, Haifa, Israel
Venue:
Journal of the ACM (JACM)
Year:
1985

Citing 5
Cited 3

The complexity of promise problems with applications to public-key cryptography

Information and Control
An Overview of the Theory of Computational Complexity

Journal of the ACM (JACM)
Recursive Properties of Abstract Complexity Classes

Journal of the ACM (JACM)
On Reducibility to Complex or Sparse Sets

Journal of the ACM (JACM)
Reducibility, randomness, and intractibility (Abstract)

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing

NP is as easy as detecting unique solutions

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The existence and density of generalized complexity cores

Journal of the ACM (JACM)
Instance complexity

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nancy Lynch proved that if a decision problem A is not solvable in polynomial time, then there exists an infinite recursive subset X of its domain on which the decision is almost everywhere complex. In this paper, general theorems of this kind that can be applied to several well-known automata-based complexity classes, including a common class of randomized algorithms, are proved.