Searching for "Randomness and reducibility." – sorted by Relevance.
-
Randomness and reducibility
- Randomness and Reducibility ⋆ Rod G. Downey 1 , Denis R. Hirschfeldt 2 , and Geoff LaForte 3 1
- Cited by 19 (4 self) – Add To MetaCart
-
Self-Stabilization: Randomness to Reduce Space
- Self-Stabilization: Randomness to Reduce Space Ted Herman Department of Computer Sciences
- Cited by 9 (0 self) – Add To MetaCart
-
Extracting all the Randomness and Reducing the Error in Trevisan's Extractors
- Extracting all the Randomness and Reducing the Error in Trevisan's Extractors Ran Raz y Omer
- Cited by 60 (15 self) – Add To MetaCart
-
On the Random-Self-Reducibility . . .
- ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUM y AND LANCE FORTNOW z
- Add To MetaCart
-
On The Random-Self-Reducibility Of Complete Sets
- ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUM y AND LANCE FORTNOW z
- Cited by 54 (14 self) – Add To MetaCart
-
On Coherence, Random-Self-Reducibility, and Self-Correction
- ON COHERENCE, RANDOM-SELF-REDUCIBILITY, AND SELF-CORRECTION Joan Feigenbaum, Lance Fortnow, Sophie
- Cited by 9 (7 self) – Add To MetaCart
-
Randomization does not reduce the average delay in parallel packet switches
- Randomization does not Reduce the Average Delay in Parallel Packet Switches ∗ Hagit Attiya
- Cited by 1 (1 self) – Add To MetaCart
-
2-local random reductions to 3-valued functions
- language L is 2-locally random reducible to a Boolean function, then L ∈ PSPACE/poly. Fortnow & Szegedy
- Cited by 1 (0 self) – Add To MetaCart
-
Eurographics Symposium on Rendering 2003
- and space, and use randomization to reduce the time and storage complexity. To speed up convergence
- Add To MetaCart
-
On Operators of Higher Types
- ] showing that the polynomial hierarchy is randomly reducible to \Phi P and Turing reducible to PP made
- Cited by 2 (1 self) – Add To MetaCart

