Limits on Alternation-Trading Proofs for Time-Space Lower Bounds

Limits on Alternation-Trading Proofs for Time-Space Lower Bounds

This paper characterizes alternation trading based proofs that the satisfiability problem is not in the time and space bounded class DTISP(n c , n ϵ ), for various values c

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Buss, S. R., Williams, R.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
alternation-trading proofs
Approximation algorithms
Computers
Educational institutions
Inference algorithms
lower bounds
non-deterministic time
NP-complete problem
Runtime
satisfiability
time-space tradeoffs
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper characterizes alternation trading based proofs that the satisfiability problem is not in the time and space bounded class DTISP(n c , n ϵ ), for various values c
ISSN:1093-0159
2575-8403
DOI:10.1109/CCC.2012.30