A New Proof for the Monte Carlo Constructibility of log log n
Download:
|
|
by Ryuhei Uehara
http://www.komazawa-u.ac.jp/~uehara/ps/twcu-m-0002.ps.gz
Add To MetaCart
Abstract:
The Monte Carlo constructibility of log log n has proved by Karpinski and Verbeek ([KV87]). They proposed an algorithm, and proved the constructibility by applying a statistical result in [Fel57] to the algorithm. We give a new algorithm, and prove the constructibility by analyzing the algorithm.
Citations
| 979 | An introduction to probability theory and its application, volume I – Feller - 1967 |
| 29 | Probabilistic two-way machines – Freivalds - 1981 |
| 6 | Nondeterministic computations in sublogarithmic space and space constructability – Geffert - 1991 |
| 3 | Lower bounds for the space complexity of context free recognition – Alt, Mehlhorn - 1976 |
| 2 | Space bounds for processing counterless inputs – Freedman, Ladner - 1975 |
