Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with sat
Search options not deleted
user 524874
Questions about the Boolean satisfiability problem from computability and complexity theory. If your question is about the college entrance exam called the SAT, you are on the wrong site.
3
votes
0
answers
252
views
Is there a version of 3-SAT that is NP-complete but grows like $2^n$ instead of $2^{n \choos...
But empirically with SAT solvers, the hardest SAT problems have far fewer terms than this (if you have too few or too many terms SAT is easy to solve). … It seems like we need some kind of windowed-3-SAT where there are $n*k$ clauses and clauses in the span $[k*i,k*(i+1)]$ can choose from variables $x_{i-w}$ to $x_{i+w}$. …
- 31