Sciweavers

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

30

STACS
2010
Springer

favoriteEmaildiscussreport

145views Theoretical Computer Science» more STACS 2010»

Alternation-Trading Proofs, Linear Programming, and Lower Bounds

14 years 5 months ago

Alternation-Trading Proofs, Linear Programming, and Lower Bounds

Download www.cs.cmu.edu

Ryan Williams

Real-time Traffic

STACS 2010 | Theoretical Computer Science |

claim paper

Related Content

» Improved Lower Bounds for TreeLike Resolution over Linear Inequalities

» Lower bounds for designs in symmetric spaces

» On Span Programs

» Lower bounds for adaptive linearity tests

» Random Cnfs are Hard for the Polynomial Calculus

» An linear programming based lower bound for the simple assembly line balancing problem

» Lower bounds for twoperiod grooming via linear programming duality

» New algorithms for singly linearly constrained quadratic programs subject to lower and upp...

» Soft car sequencing with colors Lower bounds and optimality proofs

Post Info
More Details (n/a)

Added	14 May 2010
Updated	14 May 2010
Type	Conference
Year	2010
Where	STACS
Authors	Ryan Williams

Comments (0)