Iraids, Jānis
- Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
2018/07/13 by Andris Ambainis, Kaspars Balodis, Ambainis, Andris +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
- Parameterized Quantum Query Complexity of Graph Collision
2013/05/05 by Andris Ambainis, Ambainis, Andris, Kaspars Balodis +7 · 1 citation
Computer Science · Physics and Astronomy · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Quantum Computing Algorithms and Architecture #cs.CC #cs.DS #quant-ph
- 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
- Integer Complexity: Experimental and Analytical Results
2012/03/29 by Jānis Iraids, Kaspars Balodis, Iraids, Jānis +9 · 1 citation
Computer Science · Mathematics · #Advanced Mathematical Identities #Computability, Logic, AI Algorithms #FOS: Mathematics #History and Theory of Mathematics #Number Theory (math.NT) #math.NT