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

From MaRDI portal
Revision as of 02:09, 22 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q113879646, #quickstatements; #temporary_batch_1708557319324)
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