On Separators, Segregators and Time versus Space

by Rahul Santhanam , To Paul
Citations:6 - 0 self

Active Bibliography

2 Automated proofs of time lower bounds – R. Ryan Williams - 2007
Lower bounds on the complexity of recognizing SAT by multitape TMs – Rahul Santhanam
6 Lower bounds on the complexity of recognizing SAT by Turing machines – Rahul Santhanam
www.stacs-conf.org ALTERNATION-TRADING PROOFS, LINEAR PROGRAMMING, AND – Lower Bounds, Ryan Williams - 2010
unknown title – Jean-yves Marion, Thomas Schwentick, Tu Dortmundt
Diagonalization – Lance Fortnow - 2000
82 Provably efficient scheduling for languages with fine-grained parallelism – Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias - 1995
11 Time-Space Tradeoffs for Counting NP Solutions Modulo Integers – R. Ryan Williams - 2007
10 Algorithms and Resource Requirements for Fundamental Problems – R. Ryan Williams - 2007
14 Inductive Time-Space Lower Bounds for SAT and Related Problems – Ryan Williams - 2005
Abstract – Chris Pollett, Eric Miles - 2008
25 On the Complexity of SAT – Richard Lipton, Anastasios Viglas - 1999
1 Basic Complexity – Eric Allender, Eric Allender, Catherine Mccartin, Catherine Mccartin
12 Observations on Grammar and Language Families – Henning Fernau - 1994
1 My Favorite Ten Complexity Theorems of the Past Decade – Lance Fortnow
2 Complexity Classes – Eric Allender, Michael C. Loui, Kenneth W. Regan - 1998
19 The Complexity of Reconfiguring Network Models – Y. Ben-asher, K. -j. Lange, D. Peleg, A. Schuster - 1992
3 Linearly bounded infinite graphs – Arnaud Carayol, Antoine Meyer - 2007
5 Presentations for Subsemigroups of Groups – Alan James Cain - 2005