Pages that link to "Item:Q488052"

The following pages link to How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052):

Displaying 2 items.

• A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function (Q669952) (← links)
• (Q5092483) (← links)