On the complexity of Jensen's algorithm for counting fixed polyominoes.
Gill BarequetMicha MoffiePublished in: J. Discrete Algorithms (2007)
Keyphrases
- computational complexity
- np hard
- computational cost
- experimental evaluation
- linear complexity
- high computational complexity
- times faster
- detection algorithm
- cost function
- worst case
- high accuracy
- improved algorithm
- dynamic programming
- significant improvement
- search space
- optimal solution
- learning algorithm
- theoretical analysis
- segmentation algorithm
- optimization algorithm
- preprocessing
- space complexity
- linear programming
- particle swarm optimization
- expectation maximization
- matching algorithm
- objective function