5 search results - page 1 / 1 » Simplified derandomization of BPP using a hitting set genera... |
ECCC
2000
13 years 10 months ago
2000
Abstract. A hitting-set generator is a deterministic algorithm that generates a set of strings such that this set intersects every dense set that is recognizable by a small circuit...
STACS
1999
Springer
14 years 3 months ago
1999
Springer
We demonstrate how to use Lautemann's proof that BPP is in p 2 to exhibit that BPP is in RPPromiseRP. Immediate consequences show that if PromiseRP is easy or if there exist q...
APPROX
2009
Springer
14 years 5 months ago
2009
Springer
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
COCO
2003
Springer
14 years 4 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
VIS
2007
IEEE
15 years 5 days ago
2007
IEEE
Analysis of materials obtained from physical simulations is important in the physical sciences. Our research was motivated by the need to investigate the properties of a simulated...