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 1907
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.
8
votes
Accepted
efficient arithmetic with (short) Conway games?
There are indeed (relatively) efficient algorithms to do this (computing canonical form in particular, deciding equality etc.) …
- 1,305
5
votes
Accepted
How to efficiently sample uniformly from the set of $p$-equipartitions of an $n$-set?
Randomly permute $n$ and then divide into blocks of size $n/p$.
- 1,305
1
vote
Accepted
Ordered lattice point enumeration
I am going to try to answer the version of the Observation which seems to imply that the original "orthogonal" basis condition really is meant to mean "positive multiples of the standard basis vectors …
- 1,305
3
votes
An interesting variant on the maximum independent set problem.
Suppose that $G$ is obtained from the complete bipartite graph with parts of size $n/2$ by adding some edges in each part. Then a maximum independent set lies in one part or the other, so determining …
- 1,305