Image de couverture de livre

Quantum Speedup for Some Geometric 3SUM-Hard Problems and Beyond

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Keil, J. Mark, McLeod, Fraser, Mondal, Debajyoti
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry Data Structures and Algorithms 68Q12 F.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Maximum Clique Problem in a Disk Graph Made Easy
par: Keil, J. Mark, et autres
Publié: (2024)

Maximum Matchings in Geometric Intersection Graphs
par: Bonnet, Édouard, et autres
Publié: (2019)

Quantum Search without Global Diffusion
par: Burke, John, et autres
Publié: (2026)

On Solving Simple Curved Nonograms
par: Löffler, Maarten, et autres
Publié: (2025)

Binary Tree Block Encoding of Classical Matrix
par: Li, Zexian, et autres
Publié: (2025)

A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
par: Jiang, Xinwen, et autres
Publié: (2021)

Experimental algorithms for the dualization problem
par: Mezzini, Mauro, et autres
Publié: (2025)

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees
par: Bojikian, Narek, et autres
Publié: (2025)

Tensor Decomposition for Non-Clifford Gate Minimization
par: Khoruzhii, Kirill, et autres
Publié: (2026)

Parameterized Complexity of Directed Traveling Salesman Problem
par: Blažej, Václav, et autres
Publié: (2025)

On weighted graph separation problems and flow-augmentation
par: Kim, Eun Jung, et autres
Publié: (2022)

Overlapping Biclustering
par: Bentert, Matthias, et autres
Publié: (2025)

Simple minimally unsatisfiable subsets of 2-CNFs
par: Kullmann, Oliver, et autres
Publié: (2026)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
par: Bergougnoux, Benjamin, et autres
Publié: (2025)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
par: Gu, Qian-Ping, et autres
Publié: (2025)

Finding Cliques in Geometric Intersection Graphs with Grounded or Stabbed Constraints
par: Keil, J. Mark, et autres
Publié: (2025)

On Outer Bi-Lipschitz Extensions of Linear Johnson-Lindenstrauss Embeddings of Subsets of $\mathbb{R}^N$
par: Chiclana, Rafael, et autres
Publié: (2024)

NP-membership for the boundary-boundary art-gallery problem
par: Stade, Jack
Publié: (2025)

Sublinear-Time Computation in the Presence of Online Erasures
par: Kalemaj, Iden, et autres
Publié: (2021)

The Presort Hierarchy for Geometric Problems
par: van der Hoog, Ivor, et autres
Publié: (2026)

A Polynomial-time Algorithm to Solve the Airplane Refueling Problem: the Sequential Search Algorithm
par: Cui, Jinchuan, et autres
Publié: (2022)

Coloring Hardness on Low Twin-Width Graphs
par: Bonnet, Édouard
Publié: (2025)

Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares
par: Göbel, Andreas, et autres
Publié: (2025)

Improved Approximation Algorithms for the Expanding Search Problem
par: Griesbach, Svenja M., et autres
Publié: (2023)

Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time
par: Agrawal, Akanksha, et autres
Publié: (2024)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
par: Jansen, Klaus, et autres
Publié: (2024)

The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs
par: Chauhan, Archit, et autres
Publié: (2024)

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
par: Gálvez, Waldo, et autres
Publié: (2025)

The Quasi-probability Method and Applications for Trace Reconstruction
par: Rubinstein, Ittai
Publié: (2024)

Random-Order Online Independent Set of Intervals and Hyperrectangles
par: Garg, Mohit, et autres
Publié: (2024)

$XX^{t}$ Can Be Faster
par: Rybin, Dmitry, et autres
Publié: (2025)

Subsequence Matching and Analysis Problems for Formal Languages
par: Fazekas, Szilárd Zsolt, et autres
Publié: (2024)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
par: Bampis, Evripidis, et autres
Publié: (2024)

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
par: Bonnet, Édouard, et autres
Publié: (2026)

O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold
par: Bell, Tolson, et autres
Publié: (2024)

Steiner Tree Parameterized by Multiway Cut and Even Less
par: Jansen, Bart M. P., et autres
Publié: (2024)

Optimal Discretization is Fixed-parameter Tractable
par: Kratsch, Stefan, et autres
Publié: (2020)

Algorithms for Minimum Membership Dominating Set Problem
par: Reddy, Sangam Balchandar, et autres
Publié: (2024)

Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations
par: Kar, Debajyoti, et autres
Publié: (2026)

Safety-Certified CRT Sparse FFT: $Ω(k^2)$ Lower Bound and $O(N \log N)$ Worst-Case
par: Flouro, Aaron R., et autres
Publié: (2026)