MPF Problem over Modified Medial Semigroup Is NP-Complete.
Eligijus SakalauskasAleksejus MihalkovichPublished in: Symmetry (2018)
Keyphrases
- np complete
- randomly generated
- satisfiability problem
- np hard
- computational complexity
- shape representation
- object recognition
- constraint satisfaction problems
- shape analysis
- conjunctive queries
- polynomial time complexity
- database
- pspace complete
- data complexity
- self organizing maps
- data management
- d objects
- upper bound
- lower bound
- computer vision
- learning algorithm
- genetic algorithm
- medial axis
- databases
- shape description
- data sets
- np complete problems
- polynomially solvable
- real time