Pages that link to "Item:Q1346612"

The following pages link to On the degree of Boolean functions as real polynomials (Q1346612):

Displaying 5 items.

• Unbounded-error quantum query complexity (Q638526) (← links)
• One complexity theorist's view of quantum computing (Q1870556) (← links)
• A lower bound on the quantum query complexity of read-once functions (Q1880783) (← links)
• On exact quantum query complexity (Q2350895) (← links)
• The quantum query complexity of the abelian hidden subgroup problem (Q2373740) (← links)