Pages that link to "Item:Q1880783"

The following pages link to A lower bound on the quantum query complexity of read-once functions (Q1880783):

Displayed 4 items.

• On the power of Ambainis lower bounds (Q557899) ‎ (← links)
• Polynomial degree vs. quantum query complexity (Q2490260) ‎ (← links)
• Quantum Random Walks – New Method for Designing Quantum Algorithms (Q5448636) ‎ (← links)
• Quantum Algorithms for Evaluating Min-Max Trees (Q5503293) ‎ (← links)