| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4950582 | Information and Computation | 2017 | 17 Pages |
Abstract
Proving our results requires several new ideas, including a completely different proof of the hierarchy theorem for non-deterministic polynomial time than the ones previously known.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Lance Fortnow, Rahul Santhanam,