Infinite vs. finite size-bounded randomized computations
Open in viewer
Open access
Date
2014-06Type
- Journal Article
Open in viewer
Permanent link
https://doi.org/10.3929/ethz-a-010892309Publication status
publishedJournal / series
Journal of Computer and System SciencesVolume
Pages / Article No.
Publisher
ElsevierSubject
Probabilistic computations; Las Vegas randomization; Time complexity; Size complexity; Rotating finite automata; Sweeping finite automataOrganisational 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
Is new version of: http://hdl.handle.net/20.500.11850/83534
More
Show all metadata