Classical and Quantum Algorithms for Assembling a Text from a Dictionary
DOI10.33581/1561-4085-2021-24-3-207-221zbMATH Open1530.81043OpenAlexW3211059197MaRDI QIDQ6132582FDOQ6132582
Authors: Kamil Khadiev, Vladislav Remidovskii 
Publication date: 17 August 2023
Published in: Nonlinear Phenomena in Complex Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.33581/1561-4085-2021-24-3-207-221
Protein sequences, DNA sequences (92D20) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) String and superstring theories; other extended objects (e.g., branes) in quantum field theory (81T30) Derived categories of sheaves, dg categories, and related constructions in algebraic geometry (14F08) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Mathematical modeling or simulation for problems pertaining to quantum theory (81-10)
Cites Work
- Quantum computation and quantum information. 10th anniversary edition
- Efficient randomized pattern-matching algorithms
- An optimal quantum algorithm for the oracle identification problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum pattern matching fast on average
- String matching in \(\tilde O(\sqrt n+\sqrt m)\) quantum time
- Guide to competitive programming. Learning and improving algorithms through contests
- On the quantum and classical complexity of solving subtraction games
- Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester
- Quantum algorithm for dynamic programming approach for DAGs. Applications for Zhegalkin polynomial evaluation and some problems on DAGs
- Optimal in-place suffix sorting
Cited In (1)
This page was built for publication: Classical and Quantum Algorithms for Assembling a Text from a Dictionary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132582)
