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 polynomial-time
Search options not deleted
user 109
20
votes
Why is 2SAT in P?
As Walter says, clauses of 2-SAT have a special form. This can be exploited to find solutions quickly.
There are actually several classes of SAT instances that can be decided in polynomial time, and …
- 19.2k
2
votes
Accepted
Packing $n$ objects into $m$ bins whose size is variable
One simple "bad" input that needs to be considered for worst-case analysis of this problem is as follows.
Let $c=(\sqrt{17}-1)/2 \approx 1.56$.
There are three objects of size $c$, $1$, and $1$.
Ther …
- 19.2k