scientific article; zbMATH DE number 7350751

zbMath1464.05157MaRDI QIDQ4989372

Dieter P. Gruber, Paul Tabatabai

Publication date: 25 May 2021

Full work available at URL: https://cs.uwaterloo.ca/journals/JIS/VOL24/Tabatabai/taba4.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

partitioncomputational complexityinteger programmingcellular automataNP-completenesscoloringgridmaximization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Coloring of graphs and hypergraphs (05C15) Recreational mathematics (00A08)

Related Items (1)

knights-and-liars

Uses Software

• Gurobi
• COIN-OR
• OEIS
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Clustering to minimize the maximum intercluster distance
• Maximum density stable patterns in variants of Conway's game of Life
• A complete solution to the maximum density still life problem
• Planar 3DM is NP-complete
• Integer Programming and Conway's Game of Life
• Reducibility among Combinatorial Problems

This page was built for publication: