Why sometimes probabilistic algorithms can be more effective
Authors:
- 13 November 2005
- book chapter
- Published by Springer Nature
- p. 1-14
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Probabilistic two-way machinesLecture Notes in Computer Science, 1981
- Theory of Recursive Functions and Effective Computability.The American Mathematical Monthly, 1969
- On probabilistic automata and their generalizationsAnnales Academiae Scientiarum Fennicae. Series A. I. Mathematica, 1969
- Language identification in the limitInformation and Control, 1967
- Hierarchies of memory limited computations1965
- Probabilistic automataInformation and Control, 1963
- Computability by Probabilistic Machines1956