Ultrametric vs. quantum query algorithms

DOI10.1007/978-3-319-13749-0_1MaRDI QIDQ5498735zbMATH OpenOpenAlexFDO

Authors Rūsiņš Freivalds

Publication date 10 February 2015

Published in Theory and Practice of Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-13749-0_1

zbMATH Keywords

quantum algorithmsprobabilistic algorithmsnature-inspired models of computationultrametric algorithms

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Recommendations

• Ultrametric algorithms and automata
• Ultrametric finite automata and Turing machines
• Capabilities of ultrametric automata with one, two, and three states
• Active learning of recursive functions by ultrametric algorithms
• CONTINUOUS-TIME QUANTUM WALKS ON ULTRAMETRIC SPACES

Cited in

(3)

• Ultrametric algorithms and automata
• Capabilities of ultrametric automata with one, two, and three states
• Active learning of recursive functions by ultrametric algorithms

This page was built for publication: Ultrametric vs. quantum query algorithms

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