Sciweavers

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

30

FOCS
1995
IEEE

favoriteEmaildiscussreport

84views Theoretical Computer Science» more FOCS 1995»

Lower Bounds for Monotone Span Programs

14 years 2 months ago

Lower Bounds for Monotone Span Programs

Download people.cs.uchicago.edu

Amos Beimel, Anna Gál, Mike Paterson

Real-time Traffic

FOCS 1995 | Theoretical Computer Science |

claim paper

Related Content

» On the Size of Monotone Span Programs

» Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs

» Superpolynomial Lower Bounds for Monotone Span Programs

» Monotone complexity and the rank of matrices

» A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints

» Improved Lower Bounds on the Randomized Complexity of Graph Properties

» On Span Programs

» Bounded realtime dynamic programming RTDP with monotone upper bounds and performance guara...

» Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	FOCS
Authors	Amos Beimel, Anna Gál, Mike Paterson

Comments (0)