Login / Signup

Lower bounds for Sum and Sum of Products of Read-once Formulas.

C. RamyaB. V. Raghavendra Rao
Published in: ACM Trans. Comput. Theory (2019)
Keyphrases
  • lower bound
  • objective function
  • read once formulas
  • upper bound
  • branch and bound algorithm
  • worst case
  • boolean functions
  • learning algorithm
  • computational complexity
  • min sum
  • database systems
  • data streams
  • np hard