The following pages link to (Q4542521):
Displaying 10 items.
- Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
- (Q5875509) (← links)
- An Optimal Separation of Randomized and Quantum Query Complexity (Q5890036) (← links)
- New degree bounds for polynomial threshold functions (Q5894427) (← links)
- Quantum lower bounds by quantum arguments (Q5894821) (← links)
- Distinguishing orthogonality graphs (Q6056750) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
- Quantum algorithm for lexicographically minimal string rotation (Q6151147) (← links)
- Communication and information complexity (Q6200329) (← links)
- Upper bounds on communication in terms of approximate rank (Q6635689) (← links)