Richard J. Lipton, Anastasios Viglas  Home/Search
Context Related
| princeton.edu/~viglas/pub/ts.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: princeton.edu/~vig...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that non-deterministic time NT IME(n) is not contained in deterministic time n 2-# and poly-logarithmic space, for any # > 0. This implies that (infinitely often) satisfiability cannot be solved in time O(n 2-# ) and polylogarithmic space. A similar result is presented for uniform circuits. 1 Introduction Recently Fortnow [7] proved the first non-trivial timespace trade-off for satisfiability. His main result was that SAT is not computable in non-deterministic time n 1+o(1) and... (Update)
Context of citations to this paper: More
.... 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...
...SAT cannot be solved in quasilinear time and space O(n 1 ) on a deterministic Turing machine, for any 0. Recently, Lipton and Viglas [9], using techniques of Kannan [7] have improved the tradeo s in [4] For example, they show that SAT cannot be accepted by a TM that...
Cited by: More
A Time Lower Bound for Satisfiability - van Melkebeek, Raz (2004) (Correct)
The Complexity of Resource-Bounded Propositional Proofs - Atserias (2001) (Correct)
Time-Space Lower Bounds for Satisfiability - van Melkebeek (2001) (Correct)
Similar documents (at the sentence level):
74.5%: On the Complexity of SAT - Lipton, Viglas (1999) (Correct)
Active bibliography (related documents): More All
0.9: Time-Space Tradeoffs for Satisfiability - Fortnow (1997) (Correct)
0.5: Machine Models and Linear Time Complexity - Regan (1993) (Correct)
0.5: Lower bounds on the complexity of recognizing SAT by Turing.. - Santhanam (Correct)
Similar documents based on text: More All
0.5: Relationships among Time and Space Complexity Classes - Santhanam (2001) (Correct)
0.4: On Separators, Segregators and Time versus Space - Santhanam (Correct)
0.4: Log Space Recognition and Translation of Parenthesis Languages - Lynch (1977) (Correct)
Related documents from co-citation: More All
7: Towards separating nondeterminism from determinism (context) - Kannan - 1984
5: Nearly linear time (context) - Gurevich, Shelah - 1989
5: Short propositional formulas represent nondeterministic computations (context) - Cook - 1988
BibTeX entry: (Update)
R. Lipton and A. Viglas. On the complexity of SAT. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pages 459-464. IEEE, New York, 1999. http://citeseer.ist.psu.edu/article/lipton99complexity.html More
@inproceedings{ lipton99complexity,
author = "Richard J. Lipton and Anastasios Viglas",
title = "On the Complexity of {SAT}",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "459-464",
year = "1999",
url = "citeseer.ist.psu.edu/article/lipton99complexity.html" }
Citations (may not include all citations):24 On determinism versus non-determinism and related problems (context) - Paul, Pippenger et al. - 1983
20 Nearly linear time (context) - Gurevich, Shelah - 1989
18 Time-space tradeoffs for branching programs - Beame, Saks et al. - 1998
18 On time versus space (context) - Hopcroft, Paul et al. - 1977
15 A hierarchy for nondeterministic time complexity (context) - Cook - 1973
12 Near-optimal time-space tradeoff for element distinctness (context) - Yao - 1994
11 A nearly optimal time-space lower bound for directed st-conn.. (context) - Edmonds, Poon - 1995
11 Time-space tradeoffs for undirected st- connectivity on a gr.. (context) - Edmonds - 1998
11 Nondeterministic polynomial time versus nondeterministic log.. - Fortnow - 1997
11 Time-space lower bounds for directed st-connectivity on grap.. - Barnes, Edmonds - 1998
10 Towards separating nondeterminism from determinism (context) - Kannan - 1984
9 Two time-space tradeoffs for element distinctness (context) - Karchmer - 1986
8 A general sequential time-space tradeoff for finding unique .. (context) - Beame - 1991
6 Nondeterministic linear-time tasks may require substantially.. (context) - Gurevich, Shelah - 1990
3 The problem of space invariance for sequential machines (context) - Slot, Boas - 1988
2 A graph theoretic approach to determinism versus nondetermin.. (context) - Paul, Reischuk - 1980
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.princeton.edu/~viglas/publications.html):
On the Complexity of Intersecting Finite State Automata - Karakostas, Lipton, Viglas (2000) (Correct)
On the Complexity of SAT - Lipton, Viglas (1999) (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