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 956

Questions related to the (computational) complexity of solving problems

7
votes
3answers
Consider the following problem. Given a set $S$ of integers, a function $f : \mathbb{Z} \to \mathbb{Z}$ and $k \in \mathbb{Z}$, decide wether there is $X \subseteq S$ such that $f\left(\sum_{x\in …
asked Apr 5 '12 by Char
7
votes
2answers
Often I see a sentence like this while reading texts on Computational Complexity: "For this special case of $\text{TSP}$" or "This is a special case of $\text{SAT}$" or "$k$-$\text{PARTITION}$ is t …
asked Apr 12 '12 by Char
1
vote
2answers
If there were an algorithm that factored in polynomial time by means of examining each possible factor of a complex number efficiently, could one not also use this algorithm to solve unbounded knapsa …
asked May 12 '12 by Char