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 2024
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.
2
votes
Is there any algorithm for determining 3d position in such case?
What you see in the second image is a projection of the first, after a rotation. So treat it exactly like that. Meaning, you have 4 lines in $\mathbb{R}^3$. You know their equations. Furthermore, you …
- 4,593
7
votes
Lower Bounds in Theoretical Computer Science
From the wikipedia page of matrix multiplication:
Raz (2002) proves a lower bound of $\Omega(m^2\log m)$ for bounded coefficient arithmetic circuits over the real or complex numbers.
2
votes
Accepted
Speeding the quadratic sieve with an oracle
If we know the factorization of $N$ then we can take square roots of small numbers that are quadratic residues mod all primes dividing $N$. Knowing a partial factorization of size $M\sim N^\alpha$, sq …
- 4,593