Login / Signup

Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time.

Andrew M. SuttonL. Darrell WhitleyAdele E. Howe
Published in: Theor. Comput. Sci. (2012)
Keyphrases
  • truth table
  • boolean functions
  • pseudo boolean functions
  • upper bound
  • worst case
  • linear programming
  • constraint satisfaction
  • hamming distance
  • combinatorial problems