Comparative complexity of quantum and classical OBDDs for total and partial functions (Q906414): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q62039550 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3924153 / 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
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Programs and Binary Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum branching programs and space-bounded nonuniform quantum complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809601 / 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: Q3339244 / 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: Q3262596 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:19, 11 July 2024

scientific article
Language Label Description Also known as
English
Comparative complexity of quantum and classical OBDDs for total and partial functions
scientific article

    Statements

    Comparative complexity of quantum and classical OBDDs for total and partial functions (English)
    0 references
    0 references
    21 January 2016
    0 references
    ordered binary decision diagrams
    0 references
    partial functions
    0 references
    quantum computation
    0 references
    nondeterminism
    0 references
    probabilistic OBDDs
    0 references
    complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references