A computational proof of complexity of some restricted counting problems (Q534558)

From MaRDI portal
Revision as of 19:18, 22 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A computational proof of complexity of some restricted counting problems
scientific article

    Statements

    A computational proof of complexity of some restricted counting problems (English)
    0 references
    0 references
    0 references
    0 references
    18 May 2011
    0 references

    Identifiers