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 complexity
Search options not deleted
user 45671
Relating to the level of difficulty of a calculation or the asymptotic running time of an algorithm.
4
votes
1
answer
130
views
Algorithm about finding a combination that the sum is closest to a given number
.
$$
\arg\min_{1\leq j_1,\cdots,j_n\leq k}{|x - \sum_{i=1}^n{P_{ij_i}}|}
$$
An direct algorithm with time complexity $k^n$ is trivial. … This could be a cutdown, but the complexity is still exponential.
Could I do better than this? Is there any relevant topic, algorithm or data structure that I'm missing? …
- 141