Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation (Q4488251): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rapid solution of problems by quantum computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Expressibility and Parallel Complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Information-based complexity: New questions for mathematicians / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0129183198000170 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027311911 / rank | |||
Normal rank | |||
Latest revision as of 11:48, 30 July 2024
scientific article; zbMATH DE number 1470637
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation |
scientific article; zbMATH DE number 1470637 |
Statements
Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation (English)
0 references
5 July 2000
0 references
