Prūsis, Krišjānis

1. Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
   2018/07/13 by Andris Ambainis, Ambainis, Andris, Kaspars Balodis +9 · 1 voice · 6 citations
   Computer Science · Physics and Astronomy · #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) #cs.DS #quant-ph
2. All Classical Adversary Methods are Equivalent for Total Functions
   2017/09/26 by Ambainis, Andris, Kokainis, Martins, Prūsis, Krišjānis +2 · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences
3. Quantum speedups for treewidth
   2022/02/16 by Kļevickis, Vladislavs, Prūsis, Krišjānis, Vihrovs, Jevgēnijs · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
4. 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