Cover Image

The Richness of CSP Non-redundancy

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Brakensiek, Joshua, Guruswami, Venkatesan, Jansen, Bart M. P., Lagerkvist, Victor, Wahlström, Magnus
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Computational Complexity Logic in Computer Science Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances
by: Brakensiek, Joshua, et al.
Published: (2026)

Redundancy Is All You Need (for CSP Sparsification)
by: Brakensiek, Joshua, et al.
Published: (2024)

SDPs and Robust Satisfiability of Promise CSP
by: Brakensiek, Joshua, et al.
Published: (2022)

Classification of Non-redundancy of Boolean Predicates of Arity 4
by: Brakensiek, Joshua, et al.
Published: (2026)

Restricted CSPs and F-free Digraph Algorithmics
by: Guzmán-Pro, Santiago, et al.
Published: (2025)

A Classification of Long-Refinement Graphs for Colour Refinement
by: Kiefer, Sandra, et al.
Published: (2025)

An Algorithmic Meta Theorem for Homomorphism Indistinguishability
by: Seppelt, Tim
Published: (2024)

Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
by: Seppelt, Tim
Published: (2023)

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
by: Roberson, David E., et al.
Published: (2023)

Complexity lower bounds for succinct binary structures of bounded clique-width with restrictions
by: Geniet, Colin, et al.
Published: (2026)

Small unsatisfiable $k$-CNFs with bounded literal occurrence
by: Zhang, Tianwei, et al.
Published: (2024)

The Rise of Plurimorphisms: Algebraic Approach to Approximation
by: Barto, Libor, et al.
Published: (2024)

Rice-like complexity lower bounds for Boolean and uniform automata networks
by: Goubault-Larrecq, Aliénor, et al.
Published: (2024)

The Unit Gap: How Sharing Works in Boolean Circuits
by: Krinkin, Kirill
Published: (2026)

Tight Bounds for Sparsifying Random CSPs
by: Brakensiek, Joshua, et al.
Published: (2025)

First-order logic axiomatization of metric graph theory
by: Chalopin, Jérémie, et al.
Published: (2022)

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

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

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

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

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

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

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

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

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

First-order transducibility among classes of sparse graphs
by: Gajarský, Jakub, et al.
Published: (2025)

North-East Lattice Paths Avoiding $k$ Collinear Points via Satisfiability
by: Barnoff, Aaron, et al.
Published: (2025)

On the generalized coloring numbers
by: Siebertz, Sebastian
Published: (2025)

3D-grids are not transducible from planar graphs
by: Gajarský, Jakub, et al.
Published: (2025)

First-Order Logic and Twin-Width for Some Geometric Graphs
by: Geniet, Colin, et al.
Published: (2025)

Some remarks on the uncolored versions of the original CFI-graphs
by: Chen, Yijia, et al.
Published: (2025)

Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
by: Adler, Isolde, et al.
Published: (2025)

Queen Domination by SAT Solving
by: Rostami, Taha, et al.
Published: (2025)

First order distinguishability of sparse random graphs
by: Hershko, Tal, et al.
Published: (2024)

Twin-width and permutations
by: Bonnet, Édouard, et al.
Published: (2021)

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
by: Neuen, Daniel, et al.
Published: (2026)

An Upper Bound on the Weisfeiler-Leman Dimension
by: Schneider, Thomas, et al.
Published: (2024)

Transducing Linear Decompositions of Tournaments
by: Geniet, Colin, et al.
Published: (2026)

Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees
by: Kiefer, Sandra, et al.
Published: (2024)

New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs
by: Brakensiek, Joshua, et al.
Published: (2026)