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 64337
Questions related to the (computational) complexity of solving problems
3
votes
0
answers
186
views
Showing a problem on a specific class of graphs is NP-hard
We know that a set of problems like minimum clique cover problem, coloring problem, vertex cover, ... are NP-hard for general graphs, but may be polynomial-time solvable for some classes of specific g …
- 303
0
votes
1
answer
123
views
Finding a class of graphs for which vertex coloring is NP-hard
We know that for general graphs vertex coloring problem/ minimum clique cover problem are NP-hard and for perfect graphs, they can be solved in polynomial time. There are classes of graphs which are p …
- 303
2
votes
2
answers
79
views
No polynomial time approximation algorithm better than $n^{1 − ε}$
What does this sentence mean?
For all $ε > 0$, it is NP-hard to approximate MAX CLIQUE to within $n^{1 − ε}$.
Is the fact that complexity of approximation depends on $\epsilon$ hidden in the stateme …
- 303
4
votes
2
answers
283
views
Showing a problem on a specific graph is NP-hard
Maybe there is a trivial answer to my question or maybe there is not any. But I ask it here and appreciate if anyone can give me a clear answer.
We know that a set of problems like minimum clique cov …
- 303