Tiling with bars and satisfaction of boolean formulas
From MaRDI portal
Classical propositional logic (03B05) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Computational aspects of satisfiability (68R07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)
Recommendations
Cites work
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A polyomino tiling problem of Thurston and its configurational entropy
- Conway's Tiling Groups
- scientific article; zbMATH DE number 1256699 (Why is no real title available?)
- Perfect matchings in the triangular lattice
- Tiling a simply connected figure with bars of length 2 or 3
- Tiling with polyominoes and combinatorial group theory
Cited in
(9)- Tiling a simply connected figure with bars of length 2 or 3
- Tiling figures of the plane with two bars
- From logic to tiling
- A strip-like tiling algorithm
- Almost tiling of the Boolean lattice with copies of a poset
- Tiling with bars and satisfaction of Boolean formulas
- scientific article; zbMATH DE number 1048047 (Why is no real title available?)
- scientific article; zbMATH DE number 1504645 (Why is no real title available?)
- Tilings on the butterfly lattice
This page was built for publication: Tiling with bars and satisfaction of boolean formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055914)
