The design of efficient dynamic programming and transfer matrix enumeration algorithms
From MaRDI portal
Publication:5363387
Recommendations
Cites work
- A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice
- Algebraic techniques for enumerating self-avoiding walks on the square lattice
- Analytic combinatorics
- Animaux et arbres guingois. (Animals and guingois trees)
- Counting polyominoes: yet another attack
- Enumerating 2D percolation series by the finite-lattice method: theory
- Enumerations of lattice animals and trees
- Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
- Excluded permutation matrices and the Stanley-Wilf conjecture
- On \(1324\)-avoiding permutations
- Self-avoiding polygons on the square lattice
- Using functional equations to enumerate 1324-avoiding permutations
Cited in
(3)
This page was built for publication: The design of efficient dynamic programming and transfer matrix enumeration algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363387)