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 88804
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.
4
votes
1
answer
824
views
Primality test similar to the AKS test
Let us define polynomials $P_n^{(a)}(x)$ as follows :
$P_n^{(a)}(x)=\left(\frac{1}{2}\right)\cdot\left(\left(x-\sqrt{x^2+a}\right)^n+\left(x+\sqrt{x^2+a}\right)^n\right)$
We can define these polynom …
- 2,661
1
vote
0
answers
47
views
What is the most efficient algorithm for calculating $\Phi_q(b) \operatorname{mod} N$?
paper mentioned above) for calculating $\Phi_{mp}(x) \operatorname{mod} M$ , where $m$ is an odd squarefree integer , $p$ is a prime not dividing $m$ and $M$ is a prime , but I am not sure if these two algorithms …
- 2,661