Two-way finite automata with quantum and classical states. (Q1853472): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4542516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense quantum coding and a lower bound for 1-way quantum automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state verifiers I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for probabilistic algorithms for finite state machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computations: algorithms and error correction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and quantum grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank

Revision as of 10:25, 5 June 2024

scientific article
Language Label Description Also known as
English
Two-way finite automata with quantum and classical states.
scientific article

    Statements

    Identifiers