From bit-parallelism to quantum string matching for labelled graphs

DOI10.4230/LIPICS.CPM.2023.9MaRDI QIDQ6622014zbMATH OpenFDO

Authors Massimo Equi, De Griend Arianne Meijer-Van, Veli Mäkinen

Publication date 21 October 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2023.9

zbMATH Keywords

bit-parallelismlevel DAGsquantum computationstring matching

Mathematics Subject Classification ID

Algorithms on strings (68W32)

This page was built for publication: From bit-parallelism to quantum string matching for labelled graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622014)