On the complexity of Jensen's algorithm for counting fixed polyominoes
DOI10.1016/J.JDA.2005.08.001zbMATH Open1125.05029OpenAlexW2017287316MaRDI QIDQ2457308FDOQ2457308
Authors: Gill Barequet, Micha Moffie 
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
Recommendations
Analysis of algorithms (68W40) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Asymptotic enumeration (05A16) Combinatorics on words (68R15) Polyominoes (05B50)
Cites Work
- Title not available (Why is that?)
- A Procedure for Improving the Upper Bound for the Number of n-Ominoes
- Enumerations of lattice animals and trees
- Title not available (Why is that?)
- Cell Growth Problems
- Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
- Counting polyominoes: yet another attack
- Title not available (Why is that?)
- Enumerating 2D percolation series by the finite-lattice method: theory
- On two-dimensional percolation
- Contributions to the Cell Growth Problem
- Counting lattice animals: A parallel attack
- Consecutive Primes in Arithmetic Progression
- Counting polyominoes on twisted cylinders
- On the complexity of Jensen's algorithm for counting fixed polyominoes
- Animals, Trees and Renewal Sequences: Corrigendum
Cited In (4)
This page was built for publication: On the complexity of Jensen's algorithm for counting fixed polyominoes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457308)
