Counting networks are practically linearizable (Q2942741)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Counting networks are practically linearizable
scientific article

    Statements

    Counting networks are practically linearizable (English)
    0 references
    0 references
    0 references
    0 references
    11 September 2015
    0 references

    Identifiers

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