|
|||||
|
|
On the complexity of Jensen's algorithm for counting fixed polyominoes |
|
| Authors: | Gill Barequet Micha Moffie |
| Institution: | aDepartment of Computer Science, The Technion—Israel Institute of Technology, Haifa 32000, Israel;bDepartment of Electrical and Computer Engineering, Northeastern University, Boston, MA 02115, USA |
| Abstract: | |
| Keywords: | Lattice animals Polyominoes Computational complexity |
| 本文献已被 ScienceDirect 等数据库收录！ | |