scientific article; zbMATH DE number 6292577
From MaRDI portal
Publication:5414546
zbMath1286.68297MaRDI QIDQ5414546
Publication date: 6 May 2014
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1457/0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
One-Way Finite Automata with Quantum and Classical States ⋮ Time-Space Complexity Advantages for Quantum Computing ⋮ Affine automata verifiers ⋮ From Quantum Query Complexity to State Complexity ⋮ State succinctness of two-way finite automata with quantum and classical states ⋮ Language recognition power and succinctness of affine automata ⋮ Quaternionic quantum automata ⋮ Exact Affine Counter Automata ⋮ Lifting query complexity to time-space complexity for two-way finite automata ⋮ Classical and Quantum Computations with Restricted Memory ⋮ Generalizations of the distributed Deutsch–Jozsa promise problem ⋮ Unnamed Item ⋮ The complexity of debate checking ⋮ Quantum Pushdown Automata with Garbage Tape ⋮ Promise problems solved by quantum and classical finite automata ⋮ Unbounded-error quantum computation with small space bounds ⋮ Language Recognition Power and Succinctness of Affine Automata ⋮ Uncountable classical and quantum complexity classes ⋮ Quantum State Complexity of Formal Languages ⋮ Improved constructions for succinct affine automata ⋮ Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata ⋮ Computation with multiple CTCs of fixed length and width
