Login / Signup

Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity

Roman Smolensky
Published in: STOC (1987)
Keyphrases
  • lower bound
  • significant improvement
  • data sets
  • computational cost
  • empirical studies
  • theoretical framework
  • linear algebra
  • search algorithm
  • upper bound
  • worst case