Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592)

From MaRDI portal
Revision as of 23:51, 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
Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms
scientific article

    Statements

    Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (English)
    0 references
    0 references
    0 references
    0 references
    2 November 2021
    0 references
    0 references
    constraint satisfaction problems
    0 references
    infinite domains
    0 references
    partition schemes
    0 references
    lower bounds
    0 references
    0 references
    0 references