Complexity Bounds of Constant-Space Quantum Computation (Q3451121): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963288794 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1606.08764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state verifiers I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multihead two-way probabilistic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and quantum grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of quantum finite automata to interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4771027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of simulating space-bounded quantum computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded-error quantum computation with small space bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: ANALYSIS OF QUANTUM FUNCTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\) / rank
 
Normal rank

Latest revision as of 01:00, 11 July 2024

scientific article
Language Label Description Also known as
English
Complexity Bounds of Constant-Space Quantum Computation
scientific article

    Statements

    Identifiers