1 citations · 2 across the 4 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2026
Quantum Time-Space Tradeoffs for Exponential Dynamic Programming
Susanna Caroppo, Jevgēnijs Vihrovs, Dārta Zajakina +1
We investigate the quantum algorithms for dynamic programming by Ambainis et al. (SODA'19). While giving provable complexity speedups and applicable to a variety of NP-hard problem…
quant-ph2024
Quantum Algorithms for One-Sided Crossing Minimization
Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista
We present singly-exponential quantum algorithms for the One-Sided Crossing Minimization (OSCM) problem. Given an -vertex bipartite graph , a -…