On the complexity of Jensen's algorithm for counting fixed polyominoes

DOI10.1016/j.jda.2005.08.001zbMath1125.05029OpenAlexW2017287316MaRDI QIDQ2457308

Micha Moffie, Gill Barequet

Publication date: 30 October 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2005.08.001

zbMATH Keywords

computational complexitylattice animalspolyominoes

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics on words (68R15) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Asymptotic enumeration (05A16) Polyominoes (05B50)

Related Items

λ > 4 ⋮ On the Enumeration of Permutominoes ⋮ On the complexity of Jensen's algorithm for counting fixed polyominoes

Cites Work

• Counting polyominoes: yet another attack
• Counting lattice animals: A parallel attack
• On the complexity of Jensen's algorithm for counting fixed polyominoes
• Contributions to the Cell Growth Problem
• Animals, Trees and Renewal Sequences: Corrigendum
• Enumerating 2D percolation series by the finite-lattice method: theory
• On two-dimensional percolation
• Consecutive Primes in Arithmetic Progression
• Cell Growth Problems
• A Procedure for Improving the Upper Bound for the Number of n-Ominoes
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• Enumerations of lattice animals and trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item