Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs

DOI10.1016/S0378-4754(97)00085-2zbMath1017.68954OpenAlexW2083560645WikidataQ127363449 ScholiaQ127363449MaRDI QIDQ1404687

Raquel Martínez, Bonifacio Castaño, Juan Llovet

Publication date: 21 August 2003

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-4754(97)00085-2

zbMATH Keywords

AlgorithmssystemsComputer algebraData structuresComputational methodsMatrix algebraMultivariate polynomialsDigital arithmeticMultiprocessing systemsolynomialsStraight line programs

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Uses Software

• TERA

Cites Work

• On computing the determinant in small parallel time using a small number of processors
• Straight-line programs in geometric elimination theory
• On the efficiency of effective Nullstellensätze
• Greatest common divisors of polynomials given by straight-line programs
• Le rapport entre le temps et l'espace pour l'évaluation des polynômes
• The Space Complexity of Elimination Theory: Upper Bounds
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs