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 np-hardness
Search options not deleted
user 64993
Questions related to NP-hardness and NP-completeness.
2
votes
1
answer
153
views
Hardness of computing the dimension of an integral polytope?
Given a set of linear inequalities $Ax \leq b$ let $P = \text{conv}\{x \in \{0,1\}^n \mid A x \leq b \}$ be the convex hull of all binary vectors that satisfy the given inequalities.
I am interested i …
- 187
3
votes
Accepted
Complexity of 2-coloring with extra constraints
The problem is NP-complete by a reduction from not-all-equal 3-satisfiability (NAE3SAT):
Let
$$\Phi = \bigwedge_{i=1}^n (l_{i,1} \lor l_{i,2} \lor l_{i,3})$$
be an instance of NAE3SAT.
We construct a …
- 187