Sciweavers

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

16

CC
2015
Springer

favoriteEmaildiscussreport

21views System Software» more CC 2015»

Limits on Alternation Trading Proofs for Time-Space Lower Bounds

8 years 7 days ago

Limits on Alternation Trading Proofs for Time-Space Lower Bounds

Download www.math.ucsd.edu

This paper characterizes alternation-trading based proofs that the Boolean satisﬁability problem is not in the time and space

Samuel R. Buss, Ryan Williams

Real-time Traffic

CC 2015 | System Software |

claim paper

Related Content

» AlternationTrading Proofs Linear Programming and Lower Bounds

» Theory and Practice of TimeSpace TradeOffs in Memory Limited Search

» TimeSpace Tradeoffs for Satisfiability

» Quantum TimeSpace Tradeoffs for Sorting

Post Info
More Details (n/a)

Added	17 Apr 2016
Updated	17 Apr 2016
Type	Journal
Year	2015
Where	CC
Authors	Samuel R. Buss, Ryan Williams

Comments (0)