Complexity of Promise Problems on Classical and Quantum Automata (Q2944886)

From MaRDI portal
Revision as of 17:21, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of Promise Problems on Classical and Quantum Automata
scientific article

    Statements

    title
    Complexity of Promise Problems on Classical and Quantum Automata (English)
    0 references
    author
    Maria Paola Bianchi
    0 references
    Carlo Mereghetti
    0 references
    Beatrice Palano
    0 references
    publication date
    8 September 2015
    0 references
    zbMATH Keywords
    classical automata
    0 references
    quantum automata
    0 references
    promise problem
    0 references
    descriptional complexity
    0 references
    cites work
    Q4452048
    0 references
    Q2882386
    0 references
    Q4808680
    0 references
    Q4496240
    0 references
    Q4503144
    0 references
    Q4506483
    0 references
    Q5643915
    0 references
    Probabilistic automata
    0 references
    Q5541339
    0 references
    Q5541340
    0 references
    Q5622371
    0 references

    Identifiers

    zbMATH DE Number
    6479417
    0 references
    OpenAlex ID
    W206812929
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2944886&oldid=36199649"
    Powered by MediaWiki