Let S_(n) be a subset of 2^(n), interpreted as a family of truth assignments to x_(1)
Statement
: Let S_(n) be a subset of 2^(n), interpreted as a family of truth assignments to x_(1),...,x_(n). Let S_(n)-SAT be the problem of determining satisfiability over the possible assignments in S_(n). Call S_(n) "exponential" if S_(n) > ą^(n) for some ą > 1 and all sufficiently large n. Is S_(n)-SAT NP-Hard? See this.
Record
- Source
- Added
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.