The resolution of Keller's conjecture
From MaRDI portal
Publication:5918545
DOI10.1007/s10817-022-09623-5OpenAlexW2980270303WikidataQ113901233 ScholiaQ113901233MaRDI QIDQ5918545
David E. Narváez, John Mackey, Joshua Brakensiek, Marijn J. H. Heule
Publication date: 24 October 2022
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.03740
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On Keller's conjecture in dimension seven
- Computer-aided proof of Erdős discrepancy properties
- A structure-preserving clause form translation
- Cube tilings as contributions of algebra to geometry
- Rigid polyboxes and Keller's conjecture
- A reduction of Keller's conjecture
- A cube tiling of dimension eight with no facesharing
- On a generalization of extended resolution
- Towards resolving Keller's cube tiling conjecture in dimension seven
- Short proofs without new variables
- Efficient certified RAT verification
- A combinatorial approach for Keller's conjecture
- Über lückenlose Ausfüllung des \(n\)-dimensionalen Raumes durch kongruente Würfel
- Über lückenlose Ausfüllung des \(n\)-dimensionalen Raumes durch kongruente Würfel. II
- Über einfache und mehrfache Bedeckung des \(n\)-dimensionalen Raumes mit einem Würfelgitter
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Inprocessing Rules
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Expressing Symmetry Breaking in DRAT Proofs
- Keller’s cube-tiling conjecture is false in high dimensions
- What is known about unit cubes
- Extended Keller graph and its properties
- Efficient verified (UN)SAT certificate checking
This page was built for publication: The resolution of Keller's conjecture
