A lower bound on the quantum query complexity of read-once functions (Q1880783): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:58, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on the quantum query complexity of read-once functions |
scientific article |
Statements
A lower bound on the quantum query complexity of read-once functions (English)
0 references
1 October 2004
0 references
Quantum query complexity
0 references
Quantum computation
0 references
Query complexity
0 references
Decision tree complexity
0 references
Read-once functions
0 references
Lower bounds
0 references
