Abstract.

A lower bound for computational complexity of product of linear combinations is given. The method used to obtain a lower bound is a substitution argument as in A. Borodin and I. Munro (1).

Keywords: lower bound, algebraic computational complexity, substitution argument

Bibtex entry:

@Article{Dan90,
  author =       "Vladim{\'\i}r Dan{\v c}{\'\i}k",
  title =        "Lower bounds for complexity of product of linear
                  combinations. ",
  journal =      "Computers and Artificial Intelligence",
  year =         "1990",
  volume =       "9",
  pages =        "611-614",
}

Return to Previous Level

USC Computational Biology Home Page