Login / Signup

Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers.

Albert AtseriasAnuj Dawar
Published in: ICALP (2) (2012)
Keyphrases
  • lower bound
  • upper bound
  • objective function
  • np hard
  • branch and bound
  • branch and bound algorithm
  • neural network
  • natural language
  • special case
  • error correction
  • max sat
  • optimal cost