Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 53-64
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Superiority of exact quantum automata for promise problemsInformation Processing Letters, 2012
- Unbounded-error quantum computation with small space boundsInformation and Computation, 2011
- Quantum Computational Complexity2009
- On the computational power of probabilistic and quantum branching programInformation and Computation, 2005
- Quantum branching programs and space-bounded nonuniform quantum complexityTheoretical Computer Science, 2005
- On the complexity of simulating space-bounded quantum computationscomputational complexity, 2003
- The Power of Nondeterminism and Randomness for Oblivious Branching ProgramsTheory of Computing Systems, 2003
- On Computational Power of Quantum Branching Programs2001
- Analogies and differences between quantum and stochastic automataTheoretical Computer Science, 2001
- Randomization and nondeterminism are comparable for ordered read-once branching programsLecture Notes in Computer Science, 1997