Login / Signup

The complexity of Boolean matrix root computation.

Martin Kutz
Published in: Theor. Comput. Sci. (2004)
Keyphrases
  • real valued
  • linear algebra
  • computational complexity
  • worst case
  • tree structure
  • boolean functions
  • singular value decomposition
  • databases
  • computer vision
  • multiscale
  • high dimensional
  • efficient computation