A combinatorial problem associated with nonograms

DOI10.1016/J.LAA.2005.04.034zbMATH Open1076.05015OpenAlexW2148916594MaRDI QIDQ2575597FDOQ2575597

Authors Jessica Benton, Rion Snow, Nolan Wallach 

Publication date 5 December 2005

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2005.04.034

zbMATH Keywords

partitionmatrixdominantcolumnnonogramrow

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Recommendations

• Construction of matrices with known sums of rows and columns
• An algorithm for finding the number of (0, 1, 2,…, l)-matrices with prefixed row sum and column sum vectors
• Nonograms: combinatorial questions and algorithms
• Enumeration of nonnegative integer matrices
• The asymptotics of useless hint sequences in nonograms

Cites Work

• scientific article; zbMATH DE number 51878 (Why is no real title available?)
• Combinatorial matrix theory
• On the number of possible row and column sums of \(0,1\)-matrices

Cited In (6)

• Nonograms: combinatorial questions and algorithms
• Improving the performance of evolutionary algorithms in grid-based puzzles resolution
• Solving nonograms by combining relaxations
• The asymptotics of useless hint sequences in nonograms
• A combinatorial problem on trapezoidal words.
• Solving Survo puzzles using matrix combinatorial products

This page was built for publication: A combinatorial problem associated with nonograms

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