Polynomial algorithms in computer algebra
DOI10.1007/978-3-7091-6571-3zbMath0853.12003MaRDI QIDQ1912495
Publication date: 12 May 1996
Published in: Texts \& Monographs in Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-7091-6571-3
complexity; linear systems; decomposition; Gröbner bases; computer algebra; factorization; polynomial algorithms; algebraic curve; Gosper's algorithm; solution of polynomial equations; Hankel systems; constructive algebraic geometry; algebraic curve parametrization; elementary theory of real closed fields; gcd computation; summation problems
68W30: Symbolic computation and algebraic computation
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
11Y16: Number-theoretic algorithms; complexity
14Q05: Computational aspects of algebraic curves
68R99: Discrete mathematics in relation to computer science
12-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to field theory
Related Items
Uses Software