Highly complex 4-colored rectangle-free grids -- solution unsolved multiple-valued problems

MaRDI QIDQ4583806zbMATH OpenFDO

Authors Bernd Steinbach, Christian Posthoff

Publication date 3 September 2018

Full work available at URL http://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-24-number-1-4-2015/mvlsc-24-1-4-p-369-404/

zbMATH Keywords

Boolean equationfour-valued coloringpermutation classrectangle-free gridSAT-solversoft computing

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Coloring of graphs and hypergraphs (05C15) Combinatorics of partially ordered sets (06A07) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Rectangle-free colorings of extremely complex grids using 4 colors
• scientific article; zbMATH DE number 6930532
• A square-grid coloring problem
• Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
• Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A solution to the 2-atom problem in discrete tomography

Cited in

(3)

• Rectangle-free colorings of extremely complex grids using 4 colors
• scientific article; zbMATH DE number 6930532 (Why is no real title available?)
• Ectremal binary matrices without constant 2-squares

Describes a project that uses

Uses Software

• XBOOLE

This page was built for publication: Highly complex 4-colored rectangle-free grids -- solution unsolved multiple-valued problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4583806)