Nondeterministic unitary OBDDs

DOI10.1007/978-3-319-58747-9_13zbMath1489.68060arXiv1612.07015OpenAlexW2577995574MaRDI QIDQ2399370

Aida Gainutdinova, Abuzer Yakaryılmaz

Publication date: 22 August 2017

Full work available at URL: https://arxiv.org/abs/1612.07015

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (4)

Two-way and one-way quantum and classical automata with advice for online minimization problems ⋮ Quantum versus classical online streaming algorithms with logarithmic size of memory ⋮ Error-Free Affine, Unitary, and Probabilistic OBDDs ⋮ Quantum online streaming algorithms with logarithmic memory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Superiority of exact quantum automata for promise problems
• Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\)
• Quantum automata and quantum grammars
• Quantum branching programs and space-bounded nonuniform quantum complexity
• Very narrow quantum OBDDs and width hierarchies for classical OBDDs
• On the computational power of probabilistic and quantum branching program
• Zero-knowledge against quantum attacks
• Quantum Finite Automata: A Modern Introduction
• Quantum Computability
• Branching Programs and Binary Decision Diagrams
• Developments in Language Theory
• Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
• Analogies and differences between quantum and stochastic automata

This page was built for publication: Nondeterministic unitary OBDDs