Testing Approximate Symmetry in the Plane is NP-Hard.
Sebastian IwanowskiPublished in: Theor. Comput. Sci. (1991)
Keyphrases
- np hard
- bilateral symmetry
- approximate solutions
- integer programming
- lower bound
- special case
- approximation algorithms
- three dimensional
- symmetry detection
- linear programming
- computational complexity
- exact solution
- np complete
- optimal solution
- greedy heuristic
- branch and bound algorithm
- scheduling problem
- data sets
- closely related
- test set
- minimum cost
- ground plane
- decision problems
- test data
- worst case
- piecewise linear
- software testing
- np hardness
- computationally hard
- test cases