Constraint satisfaction, graph isomorphism, and the pebbling comonad
From MaRDI portal
Publication:6612794
DOI10.1007/978-3-031-24117-8_18MaRDI QIDQ6612794
Publication date: 1 October 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Elements of finite model theory.
- An interpolation theorem in the predicate calculus
- On the expressive power of Datalog: tools and a case study.
- Affine systems of equations and counting infinitary logic
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Infinitary logics and 0-1 laws
- An optimal lower bound on the number of variables for graph identification
- On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
- On highly closed cellular algebras and highly closed isomorphisms
- Fractional isomorphism of graphs
- Logical hierarchies in PTIME
- Structure and complexity of relational queries
- Infinitary logic and inductive definability over finite structures
- Introduction to Categories and Categorical Logic
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
- A counterexample to a conjecture of Scott and Suppes
- PEBBLE GAMES AND LINEAR EQUATIONS
- On Datalog vs. LFP
- On preservation under homomorphisms and unions of conjunctive queries
- Homomorphism preservation theorems
- Relational queries computable in polynomial time
- Random Graph Isomorphism
- On Moschovakis closure ordinals
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Deux ou trois choses que je sais de Ln
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
- Classifying the Complexity of Constraints Using Finite Algebras
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- A Definability Dichotomy for Finite Valued CSPs
- Graph isomorphism in quasipolynomial time [extended abstract]
- Tractability and Learnability Arising from Algebras with Few Subpowers
- A Simple Algorithm for Mal'tsev Constraints
- Dualities for Constraint Satisfaction Problems
- A Logical Approach to Constraint Satisfaction
- Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
This page was built for publication: Constraint satisfaction, graph isomorphism, and the pebbling comonad
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612794)
