:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Bulatov, Andrei A.
Format:	Preprint
Published:	2020
Subjects:	Logic in Computer Science Combinatorics
Online Access:	https://arxiv.org/abs/2006.10239
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Local structure of idempotent algebras I
by: Bulatov, Andrei A.
Published: (2020)

Additive systems for $\mathbb{Z}$ are undecidable
by: Zabolotskii, Andrei
Published: (2025)

Modular Counting over 3-Element and Conservative Domains
by: Bulatov, Andrei A., et al.
Published: (2025)

Complexity classification of counting graph homomorphisms modulo a prime number
by: Bulatov, Andrei A., et al.
Published: (2021)

Discrete Homotopy and Promise Constraint Satisfaction Problem
by: Beikmohammadi, Arash, et al.
Published: (2025)

Modular Counting CSP: Reductions and Algorithms
by: Kazeminia, Amirhossein, et al.
Published: (2025)

Satisfiability of commutative vs. non-commutative CSPs
by: Bulatov, Andrei A., et al.
Published: (2024)

Characterizations of monadically dependent tree-ordered weakly sparse structures
by: Buffière, Hector, et al.
Published: (2026)

First order complexity of finite random structures
by: Demin, Danila, et al.
Published: (2024)

Indivisibility and uniform computational strength
by: Gill, Kenneth
Published: (2023)

Decomposing graphs into stable and ordered parts
by: Buffière, Hector, et al.
Published: (2025)

Monadic Second-Order Logic of Permutations
by: Jelínek, Vít, et al.
Published: (2025)

Decidability for Sturmian words
by: Hieronymi, Philipp, et al.
Published: (2021)

A very sharp threshold for first order logic distinguishability of random graphs
by: Benjamini, Itai, et al.
Published: (2022)

The Ideal Membership Problem and Abelian Groups
by: Bulatov, Andrei A., et al.
Published: (2022)

Advances in Algorithmic Meta Theorems
by: Siebertz, Sebastian, et al.
Published: (2024)

Separability Properties of Monadically Dependent Graph Classes
by: Bonnet, Édouard, et al.
Published: (2025)

Existential Positive Transductions of Sparse Graphs
by: Mählmann, Nikolas, et al.
Published: (2026)

Decomposition horizons and a characterization of stable hereditary classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

Epsilon-saturation for stable graphs and Littlestone classes
by: Malliaris, Maryanthe, et al.
Published: (2025)

On first-order transductions of classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
by: Mählmann, Nikolas
Published: (2025)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
by: Dreier, Jan, et al.
Published: (2024)

An algebraic proof of the dichotomy for graph orientation problems with forbidden tournaments
by: Feller, Roman, et al.
Published: (2024)

Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras
by: Barto, Libor, et al.
Published: (2021)

Two variable logic with ultimately periodic counting
by: Benedikt, Michael, et al.
Published: (2020)

Tutte's theorem as an educational formalization project
by: Otte, Pim
Published: (2025)

Convergence Laws for Extensions of First-Order Logic with Averaging
by: Adam-Day, Sam, et al.
Published: (2025)

Further Comments on Yablo's Construction
by: Schlechta, Karl
Published: (2025)

On Planarity of Graphs in Homotopy Type Theory
by: Prieto-Cubides, Jonathan, et al.
Published: (2021)

Transductions of Graph Classes Admitting Product Structure
by: Hliněný, Petr, et al.
Published: (2025)

Bijections between planar maps and planar linear normal $λ$-terms with connectivity condition
by: Fang, Wenjie
Published: (2022)

Composition Direction of Seymour's Theorem for Regular Matroids -- Formally Verified
by: Dvorak, Martin, et al.
Published: (2025)

A Formal Proof of R(4,5)=25
by: Gauthier, Thibault, et al.
Published: (2024)

Automatic constraint satisfaction problem
by: Bulatov, Andrei, et al.
Published: (2026)

Separation of congruence intervals and implications
by: Bulatov, Andrei A.
Published: (2020)

The unstable formula theorem revisited via algorithms
by: Malliaris, Maryanthe, et al.
Published: (2022)

Agnostic Online Learning and Excellent Sets
by: Malliaris, Maryanthe, et al.
Published: (2021)

The domino problem is decidable for robust tilesets
by: Aubrun, Nathalie, et al.
Published: (2024)

k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
by: Hliněný, Petr, et al.
Published: (2025)