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 complexity-theory
Search options not deleted
user 167240
Questions related to the (computational) complexity of solving problems
4
votes
1
answer
226
views
Showing the language of all graphs that are both 4-colorable and not 3-colorable is coNP-hard
As the title states, I need to prove that the language of all graphs that are both 4-colorable and not 3-colorable is coNP-hard.
I'm not looking for a solution but a clue or something to help me devel …
