Podcast #128: We chat with Kent C Dodds about why he loves React and discuss what life was like in the dark days before Git. Listen now.
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
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
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 Search options user 60611

decision problems that are at least as hard as NP-complete problems

1
vote
2answers
It is known that finding an independent set (or a clique) of size at least $k$ in a graph is $W[1]$ hard, so it is unlikely that there is $f(k)\cdot n^{O(1)}$ time algorithm for finding an independent …
asked Mar 12 '18 by chyle
1
vote
Since complement of vertex cover is independent set, and there is $2^{O(k)}\cdot n^{O(1)}$ time algorithm for finding vertex cover of size at most $k$, it will imply $2^{O(k)}\cdot n^{O(1)}$ time algo …
answered Mar 12 '18 by chyle