On solving systems of algebraic equations via ideal bases and elimination theory

Proceedings of the 4th ACM Symposium on Symbolic and Algebraic Computation, SYMSAC 1981

Volumn , Issue , 1981, Pages 206-211

  Pohst, Michael E ^a   Yun, David Y Y ^b  

^a UNIVERSITY OF COLOGNE   (Germany)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

ALGEBRAIC EQUATIONS; ELIMINATION THEORY; POLYNOMIAL REMAINDER; SYSTEMS OF ALGEBRAIC EQUATIONS; VARIABLE ELIMINATION;

ALGEBRA;

EID: 84915850913     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800206.806397     Document Type: Conference Paper

References (5)

1. Buchberger, B.: "Ein algorithmisches Kriterium fur die Loesbarkeit eines algebraischen Gleichungssystems", Aequation.es Math. 4, (1969), 374-383.
2. Buchberger, B.: "Some properties of Groebner-bases for polynomial ideals", ACM SIGSAM Bulletin No. 40, (1976), 19-24.
3. Trinks, W.: "Ueber B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu loesen", Journal of Number Theory, Vol. 10, No. 4, Nov. 1978, 475-488.
4. Yun, D. Y. Y.: "On algorithms for solving systems of polynomial equations", ACM SIGSAM Bulletin No. 27, Sept. 1973, pp. 9-15.
5. Spear, D. A.: "A Constructive approach to commutative ring theory", Proceedings 1977 MACSYMA Users' Conference, NASA CP-2012, July 1977, pp. 369-376.