Asymptotically fast computation of subresultants

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 1997, Pages 233-240

  Reischert, Daniel ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; POLYNOMIALS;

NON MODULAR ALGORITHMS; SUBRESULTANTS;

ALGORITHMS;

EID: 0030692210     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/258726.258792     Document Type: Conference Paper

References (14)