Login / Signup

Permanent does not have succinct polynomial size arithmetic circuits of constant depth.

Maurice J. JansenRahul Santhanam
Published in: Inf. Comput. (2013)
Keyphrases
  • polynomial size
  • exponential size
  • boolean functions
  • dnf formulas
  • bounded treewidth
  • knowledge compilation
  • special case