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 42371
Use for algorithms, algorithm-analysis and complexity-theory questions that aim for polynomial running time resp. time complexity. Such questions often are are reference-requests or about runtime-analysis or time-complexity.
5
votes
Why are most (or all?) polynomial time algorithms practical?
I have seen the following explanation regarding your question (1):
The powers of $n$ in the running time usually arise out of for loops or similar constructs. Each for loop in turn is needed, because …
- 1,503
4
votes
Accepted
Can we use reductions to design approximation algorithms for NP-hard problems?
Yes, but you need an approximation-preserving reduction in the opposite direction.
- 1,503
13
votes
Accepted
Why is the set of perfect squares in P?
A simple answer is "binary search". Keep track of a lower bound (starts out with 1) and an upper bound (starts out with $n$). In each iteration compute the midpoint $m$. In polytime check if $m∗m=n$. …
- 1,503