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 algorithms
Search options not deleted
user 2757
Informally, an algorithm is a set of explicit instructions used to solve a problem (e.g. Euclid's algorithm for computing the greatest common divisor of two integers). For more specific questions on algorithms, this tag may be used in conjunction with the approximation-algorithms, algorithmic-randomness and algorithmic-topology tags.
7
votes
Lagrange four-squares theorem: efficient algorithm with units modulo a prime?
There is also an unconditional deterministic polynomial-time algorithm to find $x,y,z,w \in \mathbf{F}_p^\times$ such that $x^2+y^2+z^2+w^2=n$, given any $n \in \mathbf{Z}$ and any prime $p \ge 7$.
F …
- 23.8k
11
votes
Wants: Polynomial Time Algorithm for Decomposing a Multiset of Rationals into Two Additive S...
Any general algorithm for this problem will require exponential time. In fact, just writing down the answer can take exponential time in some cases.
For example, suppose that $n=2m$ for some odd $m$ …
- 23.8k
15
votes
Variants of Waring's problem
Regarding question 1, it is easy to prove that $g'(k) \ge k$, and the expectation is that $g'(k)=k$ for all $k \ge 3$. But the equality is an open question even for $k=3$. See Deshouillers, Jean-Mar …
- 23.8k