Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

36

ICALP
2009
Springer

favoriteEmaildiscussreport

99views Programming Languages» more ICALP 2009»

Unconditional Lower Bounds against Advice

14 years 11 months ago

Unconditional Lower Bounds against Advice

Download people.cs.uchicago.edu

We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including:

Harry Buhrman, Lance Fortnow, Rahul Santhanam

Real-time Traffic

Exponential Time Classes | ICALP 2009 | Theoretical Computer Science |

claim paper

Related Content

» On the ImPossibility of ArthurMerlin Witness Hiding Protocols

» On the Complexity of Hardness Amplification

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2009
Where	ICALP
Authors	Harry Buhrman, Lance Fortnow, Rahul Santhanam

Comments (0)