Login / Signup

Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions.

Sung-Soon ChoiKyomin JungJeong Han Kim
Published in: J. Comput. Syst. Sci. (2011)
Keyphrases
  • upper bound
  • lower bound
  • fourier coefficients
  • pseudo boolean functions
  • worst case
  • branch and bound
  • branch and bound algorithm
  • fourier transform
  • boolean functions
  • aco algorithms
  • genetic algorithm
  • search space