Pages that link to "Item:Q2684236"
From MaRDI portal
The following pages link to An exact quantum algorithm for testing 3-junta in Boolean functions with one uncomplemented product (Q2684236):
Displaying 8 items.
- A quantum algorithm for testing and learning resiliency of a Boolean function (Q669925) (← links)
- An exact quantum polynomial-time algorithm for solving \(k\)-junta problem with one uncomplemented product (Q2118738) (← links)
- A exact quantum learning algorithm for the 2-junta problem in constant time (Q2165341) (← links)
- An exact quantum algorithm for the 2-junta problem (Q2240988) (← links)
- Quantum algorithms for learning and testing juntas (Q2462663) (← links)
- An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables (Q2681549) (← links)
- Quantum algorithms for testing and learning Boolean functions (Q4917194) (← links)
- An exact quantum logarithmic time algorithm for the 3-junta problem (Q6566204) (← links)