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 derandomization
Search options not deleted
user 547
Every randomized algorithm can be simulated by a deterministic algorithm, at the expense of an exponential increase in running time. Derandomization is about converting randomized algorithms into efficient deterministic algorithms.
8
votes
Efficient and simple randomized algorithms where determinism is difficult
Majority problem in a query model.
Problem. We are given a set of $n$ balls colored with two or more colors. The goal is to find a ball of the majority color (i.e., a color that occurs more than n/2 t …
- 1,965
13
votes
Does randomness buy us anything inside P?
Problem: An array $A[1..2n]$ consists of $n$ 1s and $n$ 0s. Find an $i$ such that $A[i]$ is 1.
You are allowed to query 'Which number is present in $A[i]$'? Each query takes constant time.
Solutio …
- 1,965