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 csp
Search options answers only
not deleted
user 8936
CSP stands for the constraint satisfaction problem.
9
votes
Accepted
Constraint satisfaction problem on a graph
1 in 3 Sat reduces to this problem.
http://en.wikipedia.org/wiki/One-in-three_3SAT
Set d=3, each k_i = 2 and each l_i=1
To implement negation add $x,\overline{x},a$ and $x,\overline{x},b$ and $a,b,c …
- 1,349