Related references
Note: Only part of the references are listed.Quantum Online Streaming Algorithms with Logarithmic Memory
Kamil Khadiev et al.
INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS (2021)
Error-Free Affine, Unitary, and Probabilistic OBDDs
Rishat Ibrahimov et al.
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (2021)
Quantum Online Algorithms for a Model of the Request-Answer Game with a Buffer
K. R. Khadiev et al.
UCHENYE ZAPISKI KAZANSKOGO UNIVERSITETA-SERIYA FIZIKO-MATEMATICHESKIE NAUKI (2020)
On Quantum Methods for Machine Learning Problems Part I: Quantum Tools
Farid Ablayev et al.
BIG DATA MINING AND ANALYTICS (2020)
Two-Way Quantum and Classical Machines with Small Memory for Online Minimization Problems
Kamil Khadiev et al.
INTERNATIONAL CONFERENCE ON MICRO- AND NANO-ELECTRONICS 2018 (2019)
Unary probabilistic and quantum automata on promise problems
Aida Gainutdinova et al.
QUANTUM INFORMATION PROCESSING (2018)
New Size Hierarchies for Two Way Automata
R. Ibrahimov et al.
LOBACHEVSKII JOURNAL OF MATHEMATICS (2018)
Quantum Online Algorithms with Respect to Space and Advice Complexity
K. Khadiev et al.
LOBACHEVSKII JOURNAL OF MATHEMATICS (2018)
Quantum algorithms: an overview
Ashley Montanaro
NPJ QUANTUM INFORMATION (2016)
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
F. Ablayev et al.
LOBACHEVSKII JOURNAL OF MATHEMATICS (2016)
On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-k-times branching programs
K. Khadiev
LOBACHEVSKII JOURNAL OF MATHEMATICS (2016)
The Frequent Items Problem in Online Streaming Under Various Performance Measures
Joan Boyar et al.
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (2015)
Competitive analysis of maintaining frequent items of a stream
Yiannis Giannakopoulos et al.
THEORETICAL COMPUTER SCIENCE (2015)
Comparative Complexity of Quantum and Classical OBDDs for Total and Partial Functions
A. F. Gainutdinova
RUSSIAN MATHEMATICS (2015)
The string guessing problem as a method to prove lower bounds on the advice complexity
Hans-Joachim Boeckenhauer et al.
THEORETICAL COMPUTER SCIENCE (2014)
A fast work function algorithm for solving the k-server problem
Tomislav Rudec et al.
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH (2013)
Extension of the Hierarchy for k-OBDDs of Small Width
F. M. Ablayev et al.
RUSSIAN MATHEMATICS (2013)
Superiority of exact quantum automata for promise problems
Andris Ambainis et al.
INFORMATION PROCESSING LETTERS (2012)
On quantum realisation of Boolean functions by the fingerprinting technique
F. M. Ablayev et al.
DISCRETE MATHEMATICS AND APPLICATIONS (2009)
Exponential Separation of Quantum and Classical Online Space Complexity
Francois Le Gall
THEORY OF COMPUTING SYSTEMS (2009)
Algorithms for Quantum Branching Programs Based on Fingerprinting
Farid Ablayev et al.
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE (2009)
Efficient offline algorithms for the bicriteria k-server problem and online applications
Michele Flammini et al.
JOURNAL OF DISCRETE ALGORITHMS (2006)
On the computational power of probabilistic and quantum branching program
F Ablayev et al.
INFORMATION AND COMPUTATION (2005)
Quantum branching programs and space-bounded nonuniform quantum complexity
M Sauerhoff et al.
THEORETICAL COMPUTER SCIENCE (2005)
Share Paper
