Lance Fortnow  Home/Search
Context Related
| uchicago.edu/~fortnow/paper...npvsnl.ps nec.com/homepages/fortnow/p...npvsnl.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uchicago.edu/~fortnow/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n 1+o(1) time and n 1\Gammaffl space for any ffl ? 0 on general random-access nondeterministic Turing machines. In particular, SAT cannot be solved deterministically by a Turing machine using quasilinear time and p n space. We also give lower bounds for log-space uniform NC 1 circuits and branching programs. Our proof uses two basic ideas.... (Update)
Context of citations to this paper: More
.... of Computer Science and Automation Indian Institute of Science vinay csa.iisc.ernet.in Abstract We extend the lower bound techniques of [14], to the unbounded error probabilistic model. A key step in the argument is a generalization of Nepomnja s ci s theorem from the Boolean...
.... has received a renewed deal of attention recently in the context of time space trade off lower bounds for the satisfiability problem [6, 14, 7]. The new bounds on the Weak Pigeonhole Principle that we obtain have some consequences for Feasible Number Theory whose aim is to...
Cited by: More
Uniform Constant-Depth Threshold Circuits for Division and .. - Hesse, Allender, al. (2002) (Correct)
The Complexity of Resource-Bounded Propositional Proofs - Atserias (2001) (Correct)
Improved Bounds on the Weak Pigeonhole Principle and Infinitely.. - Atserias (2001) (Correct)
Similar documents (at the sentence level):
23.7%: Nondeterministic Polynomial Time versus Nondeterministic.. - Fortnow (1996) (Correct)
Active bibliography (related documents): More All
0.9: On the Complexity of SAT - Lipton, Viglas (1999) (Correct)
0.5: On Quasilinear Time Complexity Theory - Naik, Regan, Sivakumar (1994) (Correct)
0.5: Machine Models and Linear Time Complexity - Regan (1993) (Correct)
Similar documents based on text: More All
0.4: Relationships among Time and Space Complexity Classes - Santhanam (2001) (Correct)
0.4: Lower bounds on the complexity of recognizing SAT by Turing.. - Santhanam (Correct)
0.3: Proving SAT does not have Small Circuits with an.. - Fortnow, Pavan, Sengupta (2002) (Correct)
Related documents from co-citation: More All
5: On threshold circuits and polynomial computation - Reif - 1987
4: Introduction to Circuit Complexity (context) - Vollmer - 1999
4: Log depth circuits for division and related problems (context) - Beame, Cook et al. - 1986
BibTeX entry: (Update)
L. Fortnow. Time-space tradeoffs for satisfiability. In 12th IEEE Conference in Computational Complexity, pages 52--60, 1997. http://citeseer.ist.psu.edu/fortnow97timespace.html More
@article{ fortnow00timespace,
author = "Lance Fortnow",
title = "Time-Space Tradeoffs for Satisfiability",
journal = "Journal of Computer and System Sciences",
volume = "60",
number = "2",
pages = "337-353",
year = "2000",
url = "citeseer.ist.psu.edu/fortnow97timespace.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
686 A Guide to the theory of NP-completeness (context) - Garey, Johnson et al. - 1979
534 The complexity of theorem-proving procedures (context) - Cook - 1971
141 The complexity of finite functions (context) - Boppana, Sipser - 1990
132 Relationship between nondeterministic and deterministic tape.. (context) - Savitch - 1970
126 PP is as hard as the polynomial-time hierarchy (context) - Toda - 1991
124 Journal of the ACM (context) - Chandra, Kozen et al. - 1981
116 Some connections between nonuniform and uniform complexity c.. (context) - Karp, Lipton - 1980
103 Almost optimal lower bounds for small depth circuits - Hastad - 1989
61 Relations among complexity measures (context) - Pippenger, Fischer - 1979
44 Journal of Computer and System Sciences (context) - Razborov, Rudich - 1997
39 pseudorandom generators for logspace (context) - Babai, Nisan et al. - 1992
33 Transactions of the American Mathematical Society (context) - Hartmanis, Stearns et al. - 1965
26 Bulletin of the European Association for Theoretical Compute.. (context) - Fortnow, of et al. - 1994
24 On determinism versus nondeterminism and related problems (context) - Paul, Pippenger et al. - 1983
21 The recognition problem for the set of perfect squares (context) - Cobham - 1966
20 Two-tape simulation of multitape Turing machines (context) - Hennie, Stearns - 1966
20 Nearly-linear time (context) - Gurevich, Shelah - 1989
19 A survey of Russian approaches to Perebor (context) - Trakhtenbrot - 1984
17 Universal'nyie perebornyie zadachi (context) - Levin - 1973
17 Satisfiability is quasilinear complete in NQL (context) - Schnorr - 1978
16 Rudimentary predicates and relative computation (context) - Wrathall - 1978
16 Short propositional formulas represent nondeterministic comp.. (context) - Cook - 1988
16 Relativized polynomial time hierarchies having exactly k lev.. (context) - Ko - 1989
16 Using autoreducibility to separate complexity classes - Buhrman, Fortnow et al. - 1995
15 Princeton University (context) - Bennett, PhD - 1962
12 Near-optimal time-space tradeoff for element distinctness (context) - Yao - 1994
11 A nearly optimal time-space lower bound for directed st- con.. (context) - Edmonds, Poon - 1995
10 Towards separating nondeterminism from determinism (context) - Kannan - 1984
9 Einfuhrung in die Komplexitatstheorie (context) - Reischuk - 1990
9 Two time-space tradeoffs for element distinctness (context) - Karchmer - 1986
6 Nondeterministic linear-time tasks may require substantially.. (context) - Gurevich, Shelah - 1990
6 Relativized isomorphisms of NP-complete sets (context) - Goldsmith, Joseph - 1993
4 Bounded arithmetic formulas and Turing machines of constant .. (context) - Woods - 1986
3 reduction from RAM computations to satisfiability (context) - Robson, log - 1991
3 A time-space tradeoff for language recognition (context) - D'uri's, Galil - 1984
3 volume 47 of Annals of Mathematical Studies (context) - Smullyan, Formal - 1961
3 The problem of space invariance for sequential machines (context) - Slot, Boas - 1988
1 Soviet Mathematics-- Doklady (context) - Nepomnjascii, Turing - 1970
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cs-www.uchicago.edu/~fortnow/papers/): More
Algebraic Methods for Interactive Proof Systems - Lund, Fortnow, Karloff, Nisan (1992) (Correct)
NP Might Not Be As Easy As Detecting Unique Solutions - Beigel, Buhrman, Fortnow (1998) (Correct)
Nonrelativizing Separations - Buhrman, Fortnow, Thierauf (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC