Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497)

From MaRDI portal
scientific article; zbMATH DE number 7639811
Language Label Description Also known as
English
Computational Short Cuts in Infinite Domain Constraint Satisfaction
scientific article; zbMATH DE number 7639811

    Statements

    title
    Computational Short Cuts in Infinite Domain Constraint Satisfaction (English)
    0 references
    author
    Peter Jonsson
    0 references
    Victor Lagerkvist
    0 references
    Sebastian Ordyniak
    0 references
    publication date
    9 January 2023
    0 references
    zbMATH Keywords
    constraint satisfaction
    0 references
    cites work
    Q4198056
    0 references
    Backdoor Sets for CSP.
    0 references
    Q4003410
    0 references
    Q5005145
    0 references
    Backdoors to planning
    0 references
    Q4414647
    0 references

    Identifiers

    DOI
    10.1613/jair.1.13787
    0 references
    Mathematics Subject Classification ID
    68T20
    0 references
    68Q25
    0 references
    68Q27
    0 references
    zbMATH DE Number
    7639811
    0 references
    OpenAlex ID
    W4309587002
    0 references
    arXiv ID
    2211.10144
    0 references
    Wikidata QID
    Q130982156
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5870497&oldid=37880070"
    Powered by MediaWiki