4 citations · 11 across the 9 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023
Longest Common Substring and Longest Palindromic Substring in Time
Domenico Cantone, Simone Faro, Arianna Pavone +1
The Longest Common Substring (LCS) and Longest Palindromic Substring (LPS) are classical problems in computer science, representing fundamental challenges in string processing. Bot…
cs.DS2023
Quantum Circuits for Fixed Substring Matching Problems
Domenico Cantone, Simone Faro, Arianna Pavone +1
Quantum computation represents a computational paradigm whose distinctive attributes confer the ability to devise algorithms with asymptotic performance levels significantly superi…