Covering and packing in linear space

Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto

    Publikation: Artikel i tidsskrift og konference artikel i tidsskriftTidsskriftartikelForskningpeer review

    Abstract

    Here, we introduce a new, fast zeta transform algorithm that improves the space requirement to only linear in the size of the given set family, while not increasing the time requirement
    OriginalsprogEngelsk
    TidsskriftInformation Processing Letters
    Vol/bind111
    Udgave nummer21-22
    Sider (fra-til)1033
    Antal sider3
    ISSN0020-0190
    DOI
    StatusUdgivet - 2011

    Emneord

    • Algorithms
    • Chromatic polynomial
    • Zeta transform

    Fingeraftryk

    Dyk ned i forskningsemnerne om 'Covering and packing in linear space'. Sammen danner de et unikt fingeraftryk.

    Citationsformater