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 lower-bounds
Search options answers only
not deleted
user 2618
29
votes
Accepted
Super-linear time complexity lower bounds for any natural problem in NP?
Sorry I am so late to the discussion, but I just registered...
There are non-linear time lower bounds on multitape Turing machines for NP-complete problems. These lower bounds follow from the fact th …
- 4,729
8
votes
Accepted
Proofs of Lower Bounds for Ramsey Numbers?
The best known explicit Ramsey graph construction is in the paper:
Boaz Barak, Anup Rao, Ronen Shaltiel, Avi Wigderson: 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the …
- 4,729