Infinite vs. finite size-bounded randomized computations
OPEN ACCESS
Loading...
Author / Producer
Date
2014-06
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
OPEN ACCESS
Data
Rights / License
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
80 (4)
Pages / Article No.
744 - 765
Publisher
Elsevier
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
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
Notes
Funding
132510 - Solving Computationally Hard Problems by Classifying the Hardness of Input Instances (SNF)
Related publications and datasets
Is new version of: