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 35626
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.
5
votes
Algorithms for calculating R(5,5) and R(6,6)
I like intelligent brute force algorithms. While there may be more clever ones, the following
is pretty simple. I will specialize it to the case of looking for $R(6,6)$. …
- 2,158
5
votes
What are the applications of hypergraphs?
Ford, Green, Konyagin, Maynard, and Tao - Long gaps between primes mentions a hypergraph covering theorem
of Pippenger and Spencer. This theorem is generalized and used in a
sieving method to find l …
4
votes
Mathematics of privacy?
I don't know what you can expect. You might be interested in work of Cynthia Dwork on the concept of differential privacy. The idea concerns what information can be revealed by queries to a database …
- 2,158
2
votes
Reference Request for: Finding Large Bipartite Subgraphs via Destruction of Odd Cycles in Gr...
Not a reference, but you might enjoy tinkering with this.
Decide for your graph on two parameters C and M. For each of C-many trials,
two-color the vertices. In each trial, look at the vertices v w …
- 2,158
1
vote
Estimate size of graph by taking random walks
Unless you use some exhaustive criterion for stopping, such as Anton Petrunin's suggestion
of deleting vertices while maintaining connectivity and not stopping until all vertices are gone,
I do not se …
- 2,158
1
vote
Equipartition of the circle
Not quite an answer, but food for thought.
Consider a curve with N (let's say distinct) distinguished points on it.
Call two such C and D PR (or C PR D, for projectively related) if there is
a point …
- 2,158
0
votes
All Integers from the Smallest Digit Stream with a Window Filter
The more generalized problem (given window positions, and alphabet size, find a cyclic or even non cyclic zequence such that shifting window positions gives all words of length same as concatenated wi …
- 2,158
0
votes
Square filling self avoiding walk
You can use parity and some constraints to help with the analysis. Lets reverse the numbering on
some rows so that neighboring squares have opposite parity. Since the path starts at an odd
number …
- 2,158