Login / Signup
Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations.
Pavol Duris
Juraj Hromkovic
José D. P. Rolim
Georg Schnitger
Published in:
STACS (1997)
Keyphrases
</>
finite automata
deterministic automata
probabilistic automata
regular expressions
grammatical inference
tree automata
computational complexity
worst case
hidden markov models
np hardness
knowledge representation
database
machine learning
query language
relational data