exponential time hypothesis
Sign in to saveAlso known as ETH
unproven computational hardness assumption that 3-SAT isn’t solvable in subexponential time in the worst case
Connections
time complexity
Entity
boolean satisfiability problem
Entity
International Standard Book Number
Entity
digital object identifier
Entity
Q118398
Entity
conjecture
Entity
monotonic function
Entity
P versus NP problem
Entity
disjoint sets
Entity
computational complexity theory
Entity
Q22908627
Entity
integer factorization
Entity
graph coloring
Entity
Hamiltonian path
Entity
infimum and supremum
Entity
discrete logarithm
Entity
Mathematical Reviews
Entity
independent set
Entity
conjunctive normal form
Entity
CiteSeerX
Entity