Skip to main content
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
Search options not deleted user 172612

Questions related to the (computational) complexity of solving problems

5 votes
1 answer
100 views

Is this set cover problem NP-complete? (creating a list of best movies per year)

Let $X$ be a finite set. Let $\mathcal{F}$ be a family of subsets of $X$. Assume each set $F\in\mathcal{F}$ is colored with a single color from a set of colors $C$. Is the following problem NP-complet …
TLss's user avatar
  • 53