| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331340 | Information Processing Letters | 2005 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Piotr Faliszewski, Janusz Jarosz,