3-SAT
The standard form of the Boolean satisfiability problem in which each clause contains exactly three literals. It is a special case of the first problem proven NP-complete and is often used as a benchmark for measuring the complexity of NP-hard problems.
Core Facts
Timeline (last 90 days)
ETH asserts that for NP-complete problems such as 3-SAT, there is no algorithm that runs in subexponential time (that is, O(2^{o(n)})).
The core assertion of ETH is that no algorithm solves 3-SAT in subexponential time, specifically in the form 2^Ω(n).
3-SAT is the first problem proven NP-complete (a special case of the Cook-Levin theorem).
The basic form of ETH asserts that for the 3-SAT problem, any algorithm has a worst-case time complexity of at least 2^{δn}, where n is the number of variables and δ is some positive constant.
All Facts (4)
3-SAT is the first problem proven NP-complete (a special case of the Cook-Levin theorem).
65%UnverifiedETH asserts that for NP-complete problems such as 3-SAT, there is no algorithm that runs in subexponential time (that is, O(2^{o(n)})).
50%UnverifiedThe core assertion of ETH is that no algorithm solves 3-SAT in subexponential time, specifically in the form 2^Ω(n).
50%UnverifiedThe basic form of ETH asserts that for the 3-SAT problem, any algorithm has a worst-case time complexity of at least 2^{δn}, where n is the number of variables and δ is some positive constant.
50%