Imagen de Portada

The Unit Gap: How Sharing Works in Boolean Circuits

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Krinkin, Kirill
Formato:	Preprint
Publicado:	2026
Materias:	Computational Complexity Discrete Mathematics Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

A Simple Constructive Bound on Circuit Size Change Under Truth Table Perturbation
por: Krinkin, Kirill
Publicado: (2026)

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

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

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

Smaller Circuits for Bit Addition
por: Goncharov, Mikhail, et al.
Publicado: (2025)

An Algorithmic Meta Theorem for Homomorphism Indistinguishability
por: Seppelt, Tim
Publicado: (2024)

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

Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
por: Seppelt, Tim
Publicado: (2023)

The Richness of CSP Non-redundancy
por: Brakensiek, Joshua, et al.
Publicado: (2025)

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

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

Computability of extender sets in multidimensional subshifts: asymptotic growths, dynamical constraints
por: Callard, Antonin, et al.
Publicado: (2024)

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

Symmetric Arithmetic Circuits
por: Dawar, Anuj, et al.
Publicado: (2020)

On Numbers of Simplicial Walks and Equivalent Canonizations for Graph Recognition
por: Černý, Marek
Publicado: (2026)

Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing
por: Černý, Marek, et al.
Publicado: (2025)

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

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

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

Graph Homomorphisms and Universal Algebra
por: Bodirsky, Manuel
Publicado: (2026)

CMSO-transducing tree-like graph decompositions
por: Campbell, Rutger, et al.
Publicado: (2024)

Weighted basic parallel processes and combinatorial enumeration
por: Clemente, Lorenzo
Publicado: (2024)

Boolean proportions
por: Antić, Christian
Publicado: (2021)

Complexity of Boolean automata networks under block-parallel update modes
por: Perrot, Kévin, et al.
Publicado: (2024)

Boolean Variation and Boolean Logic BackPropagation
por: Nguyen, Van Minh
Publicado: (2023)

On the Incompressibility of Truth With Application to Circuit Complexity
por: Tonon, Luke
Publicado: (2025)

Gap Amplification for Reconfiguration Problems
por: Ohsaka, Naoto
Publicado: (2023)

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

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

Logic-based analogical proportions
por: Antić, Christian
Publicado: (2024)

VC-Dimension vs Degree: An Uncertainty Principle for Boolean Functions
por: Chang, Fan, et al.
Publicado: (2025)

Gap Preserving Reductions Between Reconfiguration Problems
por: Ohsaka, Naoto
Publicado: (2022)

How to Reconfigure Your Alliances
por: Fernau, Henning, et al.
Publicado: (2025)

Learning Foundations Beneath the Stars
por: Cardone, Felice, et al.
Publicado: (2026)

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

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

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

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

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