The following pages link to Kaspars Balodis (Q2842770):
Displaying 12 items.
- One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata (Q2842771) (← links)
- Quantum Strategies Are Better Than Classical in Almost Any XOR Game (Q2843231) (← links)
- Worst Case Analysis of Non-local Games (Q2927639) (← links)
- Counting with Probabilistic and Ultrametric Finite Automata (Q2944874) (← links)
- Structured Frequency Algorithms (Q2948453) (← links)
- Separations in Query Complexity Based on Pointer Functions (Q4640297) (← links)
- Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language (Q5089167) (← links)
- Weak Parity (Q5167728) (← links)
- On the Hierarchy Classes of Finite Ultrametric Automata (Q5175118) (← links)
- Quantum Speedups for Exponential-Time Dynamic Programming Algorithms (Q5236291) (← links)
- Quantum bounds for 2D-grid and Dyck language (Q6101583) (← links)
- (Q6161147) (← links)
