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 6153
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.
3
votes
Determining a recurrence relation
I'd certainly expect to acquire some useful information by modular arithmetic, in a given situation. For example modulo a prime p, if there is a linear recurrence, then the sequence of residues must a …
- 12.6k
2
votes
Algorithms for finding rational points on an elliptic curve?
There are probabilistic algorithms, and then hard cases (evidence of a point of infinite order that is hard to find). See for example http://www.jstor.org/pss/2152939 . …
- 12.6k
12
votes
Accepted
To what extent can algorithms in undergraduate linear algebra be made continuous/polynomial/...
NB that "undergraduate linear algebra" is perhaps an artificial construct, and examples set to test whether students understand basic concepts do not really need formal algorithms to do that. …
- 12.6k