Pages that link to "Item:Q1606953"
From MaRDI portal
The following pages link to A note on quantum black-box complexity of almost all Boolean functions (Q1606953):
Displaying 6 items.
- Quantum query complexity of almost all functions with fixed on-set size (Q347109) (← links)
- Unbounded-error quantum query complexity (Q638526) (← links)
- Complexity measures and decision tree complexity: a survey. (Q1853508) (← links)
- Extremal properties of polynomial threshold functions (Q2475403) (← links)
- Quantum certificate complexity (Q2475404) (← links)
- (Q3187177) (← links)
