Balodis, Kaspars
- Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
2018/07/13 by Andris Ambainis, Ambainis, Andris, Kaspars Balodis +9 · 5 citations
Computer Science · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Physical sciences #Optimization and Search Problems #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph)
- Separations in Query Complexity Based on Pointer Functions
2015/06/15 by Ambainis, Andris, Balodis, Kaspars, Belovs, Aleksandrs +3 · 4 citations
#Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
- Parameterized Quantum Query Complexity of Graph Collision
2013/05/05 by Andris Ambainis, Kaspars Balodis, Ambainis, Andris +7 · 1 citation
Computer Science · #Quantum Computing Algorithms and Architecture #Complexity and Algorithms in Graphs #Advanced Graph Theory Research
- Unambiguous DNFs and Alon-Saks-Seymour
2021/02/16 by Balodis, Kaspars, Ben-David, Shalev, Göös, Mika +2 · 1 citation
#Computational Complexity (cs.CC) #FOS: Computer and information sciences
- Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language
2020/07/06 by Andris Ambainis, Kaspars Balodis, Ambainis, Andris +15 · 1 citation
Computer Science · #Quantum Computing Algorithms and Architecture #Optimization and Search Problems #Machine Learning and Algorithms