117 search results - page 1 / 24 » On Superlinear Lower Bounds in Complexity Theory |
COCO
1995
Springer
13 years 9 months ago
1995
Springer
STOC
2012
ACM
11 years 7 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
ECCC
2008
13 years 5 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
TCS
1998
13 years 5 months ago
1998
COCO
1993
Springer
13 years 9 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...