Efficient Algorithms for Description Problems over Finite Totally Ordered Domains (Q3631897)

From MaRDI portal
Revision as of 19:32, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient Algorithms for Description Problems over Finite Totally Ordered Domains
scientific article

    Statements

    title
    Efficient Algorithms for Description Problems over Finite Totally Ordered Domains (English)
    0 references
    author
    Angel J. Gil
    0 references
    Miki Hermann
    0 references
    Gernot Salzer
    0 references
    Bruno Zanuttini
    0 references
    publication date
    22 June 2009
    0 references
    zbMATH Keywords
    finite domain
    0 references
    description problems
    0 references
    algorithms
    0 references
    complexity
    0 references

    Identifiers

    DOI
    10.1137/050635900
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68T27
    0 references
    68W40
    0 references
    zbMATH DE Number
    5567296
    0 references
    OpenAlex ID
    W1996426177
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3631897&oldid=31561235"
    Powered by MediaWiki