Quantum complexity for vector domination problem

DOI10.1007/978-3-031-23101-8_22MaRDI QIDQ6169538

Ansis Zvirbulis, Andris Ambainis

Publication date: 14 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

quantum query complexityquantum queryelement distinctnessFenwick treesLWSQSETH

Mathematics Subject Classification ID

Data structures (68P05) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• A new algorithm for optimal 2-constraint satisfaction and its implications
• Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
• The String-to-String Correction Problem
• Quantum Algorithms for the Subset-Sum Problem
• Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language
• Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Computing and Combinatorics
• Exponential-time quantum algorithms for graph coloring problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item