Superiority of exact quantum automata for promise problems (Q413305): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:41, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Superiority of exact quantum automata for promise problems |
scientific article |
Statements
Superiority of exact quantum automata for promise problems (English)
0 references
4 May 2012
0 references
computational complexity
0 references
exact quantum computation
0 references
promise problems
0 references
succinctness
0 references
quantum finite automaton
0 references
classical finite automaton
0 references
