Login / Signup

The Parallel Complexity of Coarsest Set Partition Problems.

Sang ChoDung T. Huynh
Published in: Inf. Process. Lett. (1992)
Keyphrases
  • problems involving
  • multiresolution
  • machine learning
  • probability distribution
  • upper bound
  • small number
  • optimization problems
  • np complete
  • database
  • lower bound
  • worst case
  • polynomial time complexity