Pages that link to "Item:Q3597889"
From MaRDI portal
The following pages link to Quantum Query Complexity of Boolean Functions with Small On-Sets (Q3597889):
Displaying 9 items.
- Quantum query complexity of almost all functions with fixed on-set size (Q347109) (← links)
- A lower bound on the quantum query complexity of read-once functions (Q1880783) (← links)
- Average-case quantum query complexity (Q2766189) (← links)
- The quantum query complexity of \(\mathrm{AC}^0\) (Q2906797) (← links)
- Optimal quantum query bounds for almost all Boolean functions. (Q2957905) (← links)
- (Q4453511) (← links)
- RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC (Q5495415) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711559) (← links)
- Symmetries, graph properties, and quantum speedups (Q6654557) (← links)