Exponential Time Hypothesis
Statement
There is no -time algorithm which can determine whether a given 3SAT formula on variables is satisfiable.
Exponential Time Hypothesis. There is no -time algorithm which can determine whether a given 3SAT formula on variables is satisfiable.
This hypothesis is used to establish the quasipolynomial lower bound for planning in observable POMDPs; its status is open and it formalizes the conjectured absence of subexponential-time algorithms for 3SAT.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.