Dieter van Melkebeek  Home/Search
Context Related
| wisc.edu/~dieter/Pap...sattssurvey.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: wisc.edu/areas/theory/Seminar/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We survey the recent lower bounds on the running time of general-purpose random-access machines that solve satisfiability in a small amount of work space, and related lower bounds for satisfiability in nonuniform models. (Update)
Similar documents based on text: More All
1.3: The Computational Complexity Column - Fortnow (Correct)
0.5: Time-Space Tradeoffs for Nondeterministic Computation - Fortnow, van Melkebeek (2000) (Correct)
0.4: A Time Lower Bound for Satisfiability - van Melkebeek, Raz (2004) (Correct)
BibTeX entry: (Update)
D. van Melkebeek. Time-space lower bounds for satisfiability. The Computational Complexity Column, EATCS Bulletin 73, February, 2001, pp. 57-77. http://citeseer.ist.psu.edu/vanmelkebeek01timespace.html More
@article{ vanmelkebeek01timespace,
author = "D. van Melkebeek",
title = "Time-Space Lower Bounds for Satisfiability",
journal = "Bulletin of the European Association for Theoretical Computer Science",
volume = "73",
pages = "57--",
year = "2001",
url = "citeseer.ist.psu.edu/vanmelkebeek01timespace.html" }
Citations (may not include all citations):85 Turing machines that take advice (context) - Karp, Lipton - 1980
49 Tree-size bounded alternation (context) - Ruzzo - 1980
30 Separating nondeterministic time complexity classes (context) - Seiferas, Fischer et al. - 1978
26 Bulletin of the European Association for Theoretical Compute.. (context) - Fortnow - 2000
25 A non-linear time lower bound for Boolean branching programs - Ajtai - 1999
20 Nearly-linear time (context) - Gurevich, Shelah - 1989
16 Short propositional formulas represent nondeterministic comp.. (context) - Cook - 1988
11 the complexity of SAT - Lipton, Viglas - 1999
10 Towards separating nondeterminism from determinism (context) - Kannan - 1984
6 Super-linear time-space tradeo# lower bounds for randomized .. (context) - Beame, Saks et al. - 2000
5 Time-space lower bounds for SAT on uniform and non-uniform m.. (context) - Tourlakis - 2000
4 Personal communication (context) - Santhanam - 1999
4 Bounded arithmetic formulas and Turing machines of constant .. (context) - Woods - 1986
3 A time-space tradeo# for language recognition (context) - Duris, Galil - 1984
3 Soviet Mathematics-- Doklady (context) - Nepomnjasci, Turing - 1970
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.wisc.edu/areas/theory/Seminar/): More
On the Quantum Black-Box Complexity of Majority - Hayes, Kutin, van Melkebeek (Correct)
The Problem of Context Sensitive String Matching - Chakaravarthy, Krishnamurthy (Correct)
One-Dimensional Quantum Walks - Ambainis, Bach, Nayak, Vishwanath.. (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