Login / Signup

A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories.

Kevin J. ComptonC. Ward Henson
Published in: Ann. Pure Appl. Log. (1990)
Keyphrases
  • computational complexity
  • lower bound
  • objective function
  • np hard
  • learning algorithm
  • rough sets