Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Dense Subset Sum may be the hardest - MaRDI portal

Dense Subset Sum may be the hardest (Q4601865)

From MaRDI portal
scientific article; zbMATH DE number 6829354
Language Label Description Also known as
English
Dense Subset Sum may be the hardest
scientific article; zbMATH DE number 6829354

    Statements

    author
    Per Austrin
    0 references
    Petteri Kaski
    0 references
    Mikko Koivisto
    0 references
    Jesper Nederlof
    0 references
    publication date
    24 January 2018
    0 references
    zbMATH Keywords
    subset sum
    0 references
    additive combinatorics
    0 references
    exponential-time algorithm
    0 references
    homomorphic hashing
    0 references
    Littlewood-Offord problem
    0 references
    arXiv classification
    cs.DS
    0 references
    cs.CC
    0 references
    cs.DM
    0 references
    cs.IT
    0 references
    math.IT
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    68R05
    0 references
    68W40
    0 references
    zbMATH DE Number
    6829354
    0 references
    arXiv ID
    1508.06019
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4601865&oldid=39452796"
    Powered by MediaWiki