2 search results - page 1 / 1 » Languages to diagonalize against advice classes |
CC
2006
Springer
13 years 11 months ago
2006
Springer
Variants of Kannan's Theorem are given where the circuits of the original theorem are replaced by arbitrary recursively presentable classes of languages that use advice string...
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including: