Irreducible subcube partitions

DOI10.37236/11862arXiv2212.14685OpenAlexW4386559272MaRDI QIDQ6199189

Sascha Kurz, Marc Vinyals, Ferdinand Ihringer, Yuval Filmus, Edward A. Hirsch, Alexander V. Smal, Artur Riazanov

Publication date: 23 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.14685

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Spreads and packing problems in finite geometry (51E23) Randomized algorithms (68W20) Boolean functions (94D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Davis-Putnam reductions for minimally unsatisfiable clause-sets
• Partitions and balanced matchings of an \(n\)-dimensional cube
• Irreducible disjoint covering systems (with an application to Boolean algebra)
• Polyboxes, cube tilings and rigidity
• Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
• An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
• Cube-tilings of \(\mathbb{R}^ n\) and nonlinear codes
• A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
• On subclasses of minimal unsatisfiable formulas
• On the structure of cube tiling codes
• Generalized versions of Hall's theorem
• Smallest maximal matchings in the graph of the d-dimensional cube
• Many hard examples for resolution
• Bent Rectangles
• Irreducible disjoint covering systems
• Blocking Sets in Desarguesian Projective Planes
• CNF-Satisfiability Test by Counting and Polynomial Average Time
• Deterministic Communication vs. Partition Number
• Theory and Applications of Satisfiability Testing
• On SAT Representations of XOR Constraints
• Note on the Transfinite Case of Hall's Theorem on Representatives
• Are hitting formulas hard for resolution?

This page was built for publication: Irreducible subcube partitions