The complexity of probabilistic versus quantum finite automata (Q3085986)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of probabilistic versus quantum finite automata |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of probabilistic versus quantum finite automata |
scientific article |
Statements
The Complexity of Probabilistic versus Quantum Finite Automata (English)
0 references
1 April 2011
0 references
0.8669121861457825
0 references
0.8467943072319031
0 references
0.8409449458122253
0 references
0.8400301933288574
0 references
0.8370844125747681
0 references
