One-in-Two-Matching Problem is NP-complete
Sergio CaraccioloDavide FicheraAndrea SportielloPublished in: CoRR (2006)
Keyphrases
- np complete
- randomly generated
- satisfiability problem
- np hard
- matching algorithm
- computational complexity
- pattern matching
- keypoints
- constraint satisfaction problems
- polynomial time complexity
- feature points
- special case
- pspace complete
- conp complete
- shape matching
- data complexity
- conjunctive queries
- np complete problems
- cnf formula
- matching scheme
- affine invariant
- matching process
- graph matching
- database
- image registration
- genetic algorithm
- real time