Classical and Quantum Algorithms for Assembling a Text from a Dictionary
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)
- scientific article; zbMATH DE number 432779 (Why is no real title available?)
- scientific article; zbMATH DE number 3635490 (Why is no real title available?)
- An optimal quantum algorithm for the oracle identification problem
- Efficient randomized pattern-matching algorithms
- Guide to competitive programming. Learning and improving algorithms through contests
- On the quantum and classical complexity of solving subtraction games
- Optimal in-place suffix sorting
- Quantum algorithm for dynamic programming approach for DAGs. Applications for Zhegalkin polynomial evaluation and some problems on DAGs
- Quantum computation and quantum information. 10th anniversary edition
- Quantum pattern matching fast on average
- String matching in \(\tilde O(\sqrt n+\sqrt m)\) quantum time
- Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester
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)
