Login / Signup
On the computational complexity of partial word automata problems.
Markus Holzer
Sebastian Jakobi
Matthias Wendlandt
Published in:
NCMA (2014)
Keyphrases
</>
computational complexity
special case
np complete
problems involving
optimization problems
decision problems
benchmark problems
data sets
neural network
machine learning
text categorization
cellular automata
solving problems