Schaefer's Theorem for Graphs (Q2796406): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
aliases / en / 0aliases / en / 0
 
Schaefer's theorem for graphs
description / endescription / en
scientific article
scientific article; zbMATH DE number 6301190
Property / title
 
Schaefer's theorem for graphs (English)
Property / title: Schaefer's theorem for graphs (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1288.05169 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1145/1993636.1993724 / rank
 
Normal rank
Property / published in
 
Property / published in: Proceedings of the forty-third annual ACM symposium on Theory of computing / rank
 
Normal rank
Property / publication date
 
5 June 2014
Timestamp+2014-06-05T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 5 June 2014 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6301190 / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity dichotomy
Property / zbMATH Keywords: complexity dichotomy / rank
 
Normal rank
Property / zbMATH Keywords
 
constraint satisfaction problems
Property / zbMATH Keywords: constraint satisfaction problems / rank
 
Normal rank
Property / zbMATH Keywords
 
polymorphisms
Property / zbMATH Keywords: polymorphisms / rank
 
Normal rank
Property / zbMATH Keywords
 
ramsey theory
Property / zbMATH Keywords: ramsey theory / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2243954424 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976863752 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1011.2894 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56168969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models Without Indiscernibles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal infinite-valued constraint languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reducts of equality up to primitive positive interdefinability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of equality constraint languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm and datalog inexpressibility for temporal reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction with Countable Homogeneous Templates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducts of Ramsey structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schaefer's Theorem for Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal functions on the random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Birkhoff / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Definability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4408038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building tractable disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relation algebras and their application in temporal and spatial reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for r(5, 5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of clones on infinite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducts of the random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducts of random hypergraphs / rank
 
Normal rank

Latest revision as of 16:52, 11 July 2024

scientific article; zbMATH DE number 6301190
  • Schaefer's theorem for graphs
Language Label Description Also known as
English
Schaefer's Theorem for Graphs
scientific article; zbMATH DE number 6301190
  • Schaefer's theorem for graphs

Statements

Schaefer's Theorem for Graphs (English)
0 references
Schaefer's theorem for graphs (English)
0 references
0 references
0 references
24 March 2016
0 references
5 June 2014
0 references
constraint satisfaction
0 references
Ramsey theory
0 references
computational logic
0 references
homogeneous structures
0 references
model theory
0 references
countable random graph
0 references
universal algebra
0 references
complexity dichotomy
0 references
constraint satisfaction problems
0 references
polymorphisms
0 references
ramsey theory
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references