Infinite vs. finite size-bounded randomized computations

Download
Full text (submitted Version) (Adobe PDF, 447.3Kb)
Thumbnail
Open access
Author
Královič, Richard
Date
2014-06
Type
  • Journal Article
Rights / license
In Copyright - Non-Commercial Use Permitted
Permanent link
https://doi.org/10.3929/ethz-a-010892309
Publication status
published
External links
Search via SFX
Journal / series
Journal of Computer and System Sciences
Volume
80(4)
Pages / Article No.
744 - 765
Publisher
Elsevier
Subject
Probabilistic computations; Las Vegas randomization; Time complexity; Size complexity; Rotating finite automata; Sweeping finite automata
Organisational unit
02150 - Dep. Informatik / Dep. of Computer Science
Funding
132510 - Solving Computationally Hard Problems by Classifying the Hardness of Input Instances (SNF)
Related publications and datasets
More
Show all metadata
Citations
Cited 0 times in Web of Science
ETH Bibliography
yes
Altmetrics