Image de couverture de livre

First order complexity of finite random structures

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Demin, Danila, Zhukovskii, Maksim
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science Discrete Mathematics Combinatorics Logic Probability
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

First order distinguishability of sparse random graphs
par: Hershko, Tal, et autres
Publié: (2024)

A very sharp threshold for first order logic distinguishability of random graphs
par: Benjamini, Itai, et autres
Publié: (2022)

Characterizations of monadically dependent tree-ordered weakly sparse structures
par: Buffière, Hector, et autres
Publié: (2026)

On first-order transductions of classes of graphs
par: Braunfeld, Samuel, et autres
Publié: (2022)

First-order transducibility among classes of sparse graphs
par: Gajarský, Jakub, et autres
Publié: (2025)

First-order logic axiomatization of metric graph theory
par: Chalopin, Jérémie, et autres
Publié: (2022)

Advances in Algorithmic Meta Theorems
par: Siebertz, Sebastian, et autres
Publié: (2024)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
par: Dreier, Jan, et autres
Publié: (2024)

Separability Properties of Monadically Dependent Graph Classes
par: Bonnet, Édouard, et autres
Publié: (2025)

Existential Positive Transductions of Sparse Graphs
par: Mählmann, Nikolas, et autres
Publié: (2026)

Decomposition horizons and a characterization of stable hereditary classes of graphs
par: Braunfeld, Samuel, et autres
Publié: (2022)

Epsilon-saturation for stable graphs and Littlestone classes
par: Malliaris, Maryanthe, et autres
Publié: (2025)

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

First-Order Logic and Twin-Width for Some Geometric Graphs
par: Geniet, Colin, et autres
Publié: (2025)

Elementary first-order model checking for sparse graphs
par: Gajarský, Jakub, et autres
Publié: (2024)

The domino problem is decidable for robust tilesets
par: Aubrun, Nathalie, et autres
Publié: (2024)

The unstable formula theorem revisited via algorithms
par: Malliaris, Maryanthe, et autres
Publié: (2022)

Agnostic Online Learning and Excellent Sets
par: Malliaris, Maryanthe, et autres
Publié: (2021)

An Upper Bound on the Weisfeiler-Leman Dimension
par: Schneider, Thomas, et autres
Publié: (2024)

Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees
par: Kiefer, Sandra, et autres
Publié: (2024)

Twin-width and permutations
par: Bonnet, Édouard, et autres
Publié: (2021)

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
par: Neuen, Daniel, et autres
Publié: (2026)

North-East Lattice Paths Avoiding $k$ Collinear Points via Satisfiability
par: Barnoff, Aaron, et autres
Publié: (2025)

Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances
par: Brakensiek, Joshua, et autres
Publié: (2026)

On the generalized coloring numbers
par: Siebertz, Sebastian
Publié: (2025)

3D-grids are not transducible from planar graphs
par: Gajarský, Jakub, et autres
Publié: (2025)

Transducing Linear Decompositions of Tournaments
par: Geniet, Colin, et autres
Publié: (2026)

Some remarks on the uncolored versions of the original CFI-graphs
par: Chen, Yijia, et autres
Publié: (2025)

Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
par: Adler, Isolde, et autres
Publié: (2025)

Queen Domination by SAT Solving
par: Rostami, Taha, et autres
Publié: (2025)

A logical approach to concentration
par: Benedikt, Michael, et autres
Publié: (2026)

On merge-models
par: Buffière, Hector, et autres
Publié: (2026)

CNFs and DNFs with Exactly $k$ Solutions
par: Chandran, L. Sunil, et autres
Publié: (2025)

Flipper games for monadically stable graph classes
par: Gajarský, Jakub, et autres
Publié: (2023)

Merge-width and First-Order Model Checking
par: Dreier, Jan, et autres
Publié: (2025)

An Algorithmic Meta Theorem for Homomorphism Indistinguishability
par: Seppelt, Tim
Publié: (2024)

Verified Certificates via SAT and Computer Algebra Systems for the Ramsey $R(3, 8)$ and $R(3, 9)$ Problems
par: Li, Zhengyu, et autres
Publié: (2025)

Symbolic Sets for Proving Bounds on Rado Numbers
par: Ahmed, Tanbir, et autres
Publié: (2025)

Restricted CSPs and F-free Digraph Algorithmics
par: Guzmán-Pro, Santiago, et autres
Publié: (2025)

Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
par: Seppelt, Tim
Publié: (2023)