Cover Image

Lower Bounds on Inverse Cellular Automata via Proof Complexity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Kapytka, Maryia
Format:	Preprint
Published:	2026
Subjects:	Logic Discrete Mathematics Logic in Computer Science F.2.0
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Lower Bounds for Symmetric Circuits for the Determinant
by: Dawar, Anuj, et al.
Published: (2021)

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

Nested Sequents for Intuitionistic Grammar Logics via Structural Refinement
by: Lyon, Tim S.
Published: (2022)

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

Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials
by: Dwivedi, Prateek, et al.
Published: (2026)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
by: Fuchser, Janne, et al.
Published: (2025)

Logic-based analogical proportions
by: Antić, Christian
Published: (2024)

Foundations for an Abstract Proof Theory in the Context of Horn Rules
by: Lyon, Tim S., et al.
Published: (2023)

Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
by: Dreier, Jan
Published: (2021)

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)

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)

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)

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

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

Measuring well quasi-ordered finitary powersets
by: Abriola, Sergio, et al.
Published: (2023)

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

Verifying Sampling Algorithms via Distributional Invariants
by: Zilken, Daniel, et al.
Published: (2025)

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
by: Grohe, Martin, et al.
Published: (2023)

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

Analogical proportions II
by: Antić, Christian
Published: (2024)

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

Decidability of Querying First-Order Theories via Countermodels of Finite Width
by: Feller, Thomas, et al.
Published: (2023)

Symmetric Arithmetic Circuits
by: Dawar, Anuj, et al.
Published: (2020)

Learning Foundations Beneath the Stars
by: Cardone, Felice, et al.
Published: (2026)

On the Subspace Orbit Problem and the Simultaneous Skolem Problem
by: Bacik, Piotr, et al.
Published: (2026)

Efficient reversal of transductions of sparse graph classes
by: Dreier, Jan, et al.
Published: (2026)

Home Spaces and Invariants to Analyze Parameterized Petri Nets
by: Memmi, Gerard
Published: (2024)

SAT-Solving the Poset Cover Problem
by: Yuan, Chih-Cheng Rex, et al.
Published: (2025)

Continuous Petri Nets Faithfully Fluidify Most Permissive Boolean Networks
by: Haar, Stefan, et al.
Published: (2025)

On the number of asynchronous attractors in AND-NOT Boolean networks
by: Trinh, Van-Giang, et al.
Published: (2025)

Hypergraph rewriting and Causal structure of $λ-$calculus
by: Bajaj, Utkarsh
Published: (2024)

Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation
by: Van Caudenberg, Daimy, et al.
Published: (2025)

Hardness of busy beaver value BB(15)
by: Stérin, Tristan, et al.
Published: (2021)

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)

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