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 permutations
Search options not deleted
user 5611
Questions related to permutations, bijections from a finite (or sometimes infinite) set to itself.
1
vote
4
answers
2k
views
How is a permutation taken as an equivalent of a hash function in MinWise independent permut...
In the paper on MinWise independent permutations (MinWise independent permutations), the authors say that it is often convenient to consider permutations rather than hash functions (Pg-3). … What I understand of this paper is something like this - To reduce the dimensionality of a set, we can generate (a fixed number of) minwise independent permutations, and for all these different permutations …
- 113