The following pages link to Aleksandrs Belovs (Q488053):
Displaying 28 items.
- On the power of non-adaptive learning graphs (Q488054) (← links)
- Quantum dual adversary for hidden subgroups and beyond (Q2326799) (← links)
- Quantum algorithm for distribution-free junta testing (Q2330551) (← links)
- Quantum algorithms for learning symmetric juntas via the adversary bound (Q2351390) (← links)
- Looking for Pairs that Hard to Separate: A Quantum Approach (Q2830222) (← links)
- Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection (Q2912841) (← links)
- Adversary lower bound for the k-sum problem (Q2986881) (← links)
- (Q3467516) (← links)
- Some Algebraic Properties of Machine Poset of Infinite Words (Q3526411) (← links)
- Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing (Q4575644) (← links)
- On a Conjecture by Christian Choffrut (Q4605510) (← links)
- (Q4637977) (← links)
- Separations in Query Complexity Based on Pointer Functions (Q4640297) (← links)
- A Polynomial Lower Bound for Testing Monotonicity (Q4994983) (← links)
- Adaptive Lower Bound for Testing Monotonicity on the Line (Q5009526) (← links)
- Quantum Algorithms for Classical Probability Distributions (Q5075751) (← links)
- (Q5111161) (← links)
- Testing convexity of functions over finite domains (Q5146911) (← links)
- Time-Efficient Quantum Walks for 3-Distinctness (Q5326554) (← links)
- A polynomial lower bound for testing monotonicity (Q5361899) (← links)
- Span programs for functions with constant-sized 1-certificates (Q5415466) (← links)
- Multi-letter Reversible and Quantum Finite Automata (Q5428220) (← links)
- The completely distributive lattice of machine invariant sets of infnite words (Q5442202) (← links)
- A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases (Q5504565) (← links)
- (Q5874395) (← links)
- Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems (Q5889069) (← links)
- SOFSEM 2006: Theory and Practice of Computer Science (Q5897979) (← links)
- An exponential separation between quantum query complexity and the polynomial degree (Q6640361) (← links)
