Properties of uniformly hard languages

Authors:
Piotr Faliszewski;Janusz Jarosz
Affiliations:
Department of Computer Science, University of Rochester, Rochester, NY 14627-0226, USA;Institute of Computer Science, AGH University of Science and Technology, al. Mickiewicza 30, Kraków, Poland
Venue:
Information Processing Letters
Year:
2005

Citing 5
Cited 0

On the Structure of Polynomial Time Reducibility

Journal of the ACM (JACM)
Uniformly hard languages

Theoretical Computer Science - Australasian computer science
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
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.

Quantified Score

Hi-index	0.89

Visualization

Abstract

Uniformly hard languages are languages that do not contain too many easy instances. We show that certain problems are uniformly hard, prove the uniformly hard analog of the Time Hierarchy Theorem, and explore the properties of the polynomial hierarchy with respect to uniform hardness.