Unary probabilistic and quantum automata on promise problems (Q1617185): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
aliases / en / 0aliases / en / 0
 
Unary Probabilistic and Quantum Automata on Promise Problems
description / endescription / en
scientific article
scientific article; zbMATH DE number 6506900
Property / title
 
Unary Probabilistic and Quantum Automata on Promise Problems (English)
Property / title: Unary Probabilistic and Quantum Automata on Promise Problems (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1434.68250 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-21500-6_20 / rank
 
Normal rank
Property / published in
 
Property / published in: Developments in Language Theory / rank
 
Normal rank
Property / publication date
 
10 November 2015
Timestamp+2015-11-10T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 10 November 2015 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q45 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6506900 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2151149053 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62039553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments in Language Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of probabilistic and quantum branching program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superiority of exact quantum automata for promise problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Promise Problems on Classical and Quantum Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary probabilistic and quantum automata on promise problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical Automata on Promise Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of the distributed Deutsch–Jozsa promise problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential of Quantum Finite Automata with Exact Acceptance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3262596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quantum and probabilistic communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and quantum grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Pushdown Automata with a Garbage Tape / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical and Quantum Counter Automata on Promise Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implications of Quantum Automata for Contextuality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Finite Automata: A Modern Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3171611 / 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: On the State Complexity of Semi-quantum Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: State succinctness of two-way finite automata with quantum and classical states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very narrow quantum OBDDs and width hierarchies for classical OBDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic results on quantum automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way finite automata with quantum and classical states. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analogies and differences between quantum and stochastic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the eigenvalues of stochastic matrices in probabilistic logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative complexity of quantum and classical OBDDs for total and partial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5178455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on quantum, stochastic, and pseudo stochastic languages with few states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Promise problems solved by quantum and classical finite automata / rank
 
Normal rank

Latest revision as of 07:38, 17 July 2024

scientific article; zbMATH DE number 6506900
  • Unary Probabilistic and Quantum Automata on Promise Problems
Language Label Description Also known as
English
Unary probabilistic and quantum automata on promise problems
scientific article; zbMATH DE number 6506900
  • Unary Probabilistic and Quantum Automata on Promise Problems

Statements

Unary probabilistic and quantum automata on promise problems (English)
0 references
Unary Probabilistic and Quantum Automata on Promise Problems (English)
0 references
0 references
0 references
0 references
0 references
7 November 2018
0 references
10 November 2015
0 references
0 references
0 references
0 references
0 references
0 references
quantum finite automata
0 references
unary promise problems
0 references
bounded-error
0 references
Las-Vegas algorithms
0 references
succinctness
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references