Login / Signup

Functions that have read-once branching programs of quadratic size are not necessarily testable.

Beate BolligIngo Wegener
Published in: Inf. Process. Lett. (2003)
Keyphrases
  • computational complexity
  • objective function
  • linear functions
  • pairwise
  • special case
  • data sets
  • information retrieval
  • case study
  • basis functions
  • memory requirements
  • maximum number
  • small size