On asymptotic gate complexity and depth of reversible circuits without additional memory (Q340566)

From MaRDI portal
Revision as of 22:22, 12 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
On asymptotic gate complexity and depth of reversible circuits without additional memory
scientific article

    Statements

    On asymptotic gate complexity and depth of reversible circuits without additional memory (English)
    0 references
    14 November 2016
    0 references
    reversible logic
    0 references
    gate complexity
    0 references
    circuit depth
    0 references
    asymptotic bounds
    0 references

    Identifiers

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