Login / Signup

Parallel time and space upper-bounds for the subset-sum problem.

Carlos Alberto Alonso SanchesNei Yoshihiro SomaHoracio Hideki Yanasse
Published in: Theor. Comput. Sci. (2008)
Keyphrases
  • upper bound
  • lower bound
  • space time
  • parallel processing
  • worst case
  • sample complexity
  • lower and upper bounds
  • upper and lower bounds
  • search space
  • special case
  • shared memory