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 answers only
not deleted
user 40821
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.
1
vote
Complexity of $d$th root mod $n$
There are algorithms to solve this problem in an arbitrary such group in time $|G|^{1/2}$. … The running time is $q^{1/2}(\log (pq))^{O(1)}$ using generic algorithms. …
- 5,382
3
votes
Accepted
Algorithms for the explicit matrix isomorphism problem over $\mathbb{C}$
When specifying an algorithmic problem "over $\mathbb{C}$", you should say precisely what the input and output should be.
The isomorphism problem is less studied over $\mathbb{C}$ because it is much …
- 5,382
4
votes
On a probabilistic integer factorization algorithm given bounds for one prime factor
If $D\le 3$, it is known how to do this in polynomial time by Coppersmith's algorithm [Cop96]: note that $q \approx N^{\frac{D}{D+1}}$ and therefore $B_2-B_1 \approx q^{\frac{D-1}{D}} \approx N^{\frac …
- 5,382