Quantified Constraint Satisfaction Problem on Semicomplete Digraphs (Q5278200)

From MaRDI portal
Revision as of 11:09, 9 December 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q130954557, #quickstatements; #temporary_batch_1733738756918)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6744584
Language Label Description Also known as
English
Quantified Constraint Satisfaction Problem on Semicomplete Digraphs
scientific article; zbMATH DE number 6744584

    Statements

    title
    Quantified Constraint Satisfaction Problem on Semicomplete Digraphs (English)
    0 references
    author
    Petar Marković
    0 references
    Barnaby Martin
    0 references
    Petar Đapić
    0 references
    publication date
    13 July 2017
    0 references
    zbMATH Keywords
    quantified constraints
    0 references
    complexity
    0 references
    polymorphism
    0 references
    semicomplete digraphs
    0 references

    Identifiers

    DOI
    10.1145/3007899
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C20
    0 references
    05C85
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6744584
    0 references
    OpenAlex ID
    W2605983742
    0 references
    Wikidata QID
    Q130954557
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5278200&oldid=38261313"
    Powered by MediaWiki