A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (Q306252)

From MaRDI portal
Revision as of 23:19, 19 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 deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy
scientific article

    Statements

    title
    A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (English)
    0 references
    author
    Nir Halman
    0 references
    publication date
    31 August 2016
    0 references

    Identifiers

     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q306252&oldid=368247"
      Powered by MediaWiki