Complexity of Monomial Evaluations and Duality

Nikolai N. Vassiliev ()
Additional contact information
Nikolai N. Vassiliev: St. Petersburg Branch, Steklov Mathematical Institute of Russian Academy of Sciences

A chapter in Computer Algebra in Scientific Computing CASC’99, 1999, pp 479-484 from Springer

Abstract: Abstract We give a matrix representation for the problem of joint evaluation of monomial sets. This approach leads to a relation between the problem of evaluation of m monomials in p variables and p monomials in m variables. A relation between multiplicative complexities of these dual problems is given.

Keywords: monomials; complexity; duality; computer algebra (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-60218-4_36

Ordering information: This item can be ordered from
http://www.springer.com/9783642602184

DOI: 10.1007/978-3-642-60218-4_36

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().