Time-space lower bounds for SAT on uniform and non-uniform machines

Time-space lower bounds for SAT on uniform and non-uniform machines

The arguments used by R. Kannan (1984), L. Fortnow (1997), and Lipton-Viglas (1999) are generalized and combined with a new argument for diagonalizing over machines taking n bits of advice on inputs of length n to obtain the first nontrivial time-space lower bounds for SAT on non-uniform machines. I...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Tourlakis, I.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Circuits
Computer science
Turing machines
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The arguments used by R. Kannan (1984), L. Fortnow (1997), and Lipton-Viglas (1999) are generalized and combined with a new argument for diagonalizing over machines taking n bits of advice on inputs of length n to obtain the first nontrivial time-space lower bounds for SAT on non-uniform machines. In particular we show that for any a
ISSN:1093-0159
2575-8403
DOI:10.1109/CCC.2000.856732