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 questions only
not deleted
user 10793
CSP stands for the constraint satisfaction problem.
12
votes
2
answers
12k
views
Is the N Queens problem NP-hard?
The N-queen problem is this:
Input : N
Output : A placement of N "queens" on an NXN chessboard such that no two queens lie on the same row, column or diagonal.
Doing a google search on this, I foun …
- 365