Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations (Q5047164)

From MaRDI portal
Revision as of 18:31, 30 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7614461
Language Label Description Also known as
English
Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
scientific article; zbMATH DE number 7614461

    Statements

    Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 November 2022
    0 references
    computational complexity
    0 references
    structural complexity
    0 references
    Las Vegas
    0 references
    determinism
    0 references
    communication complexity
    0 references
    automata
    0 references
    0 references
    0 references

    Identifiers

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