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 8075
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
How can I get all the good items using quantum search algorithm?
This follows from the fact that if you want to find 1 marked item in set of size N, knowing that there are t marked items, it can be found in $O(\sqrt{n/t})$ queries. Once you find 1 marked item, dele …
- 1,332
8
votes
Accepted
How much does a quantum oracle to find a needle in a haystack really cost?
$U_f$ is easy to create from a circuit that computes $f$. (I'm assuming you have a circuit that computes $f$. If you have a Turing machine, convert it to a circuit in the standard way.)
Now given a c …
- 1,332
7
votes
What is the easiest randomized algorithm to motivate to the layperson?
id=dq6zxpq_473cvj8ggfx
It's available from his website
He gives two example of randomized algorithms, one of them is an example of an interactive proof system with the zero knowledge property. …
- 1,332
4
votes
Accepted
Finding a subgraph with slightly large size in planar graphs
I remember thinking about this a while ago, and stopped because it seemed unlikely that $log^2 n$ paths can be found in polynomial time. This was my argument, if I remember correctly.
The best know …
- 1,332
5
votes
Accepted
Practical use of probability amplification for randomized algorithms
There seems to be some confusion in your notation. When you says error $\epsilon$, do you mean the probability of failure is $\epsilon$, which means that the algorithm outputs the wrong answer with p …
- 1,332