Login / Signup
Time-space tradeoffs for width-parameterized SAT: Algorithms and lower bounds.
Eric Allender
Shiteng Chen
Tiancheng Lou
Periklis A. Papakonstantinou
Bangsheng Tang
Published in:
Electron. Colloquium Comput. Complex. (2012)
Keyphrases
</>
lower bound
worst case
upper bound
times faster
data structure
learning algorithm
computational complexity
computational cost
computationally efficient
branch and bound algorithm
online algorithms
np hard
online learning
theoretical analysis
upper and lower bounds