Superiority of exact quantum automata for promise problems (Q413305): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2032508026 / rank | |||
Normal rank |
Revision as of 23:49, 19 March 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