From post

Gröbner Bases in Mathematica: Enthusiasm and Frustration.

. Programming Environments for High-Level Scientific Problem Solving, том A-2 из IFIP Transactions, стр. 119-132. North-Holland, (1991)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Computer-unterstützter Algorithmenentwurf.. KIFS, том 59 из Informatik-Fachberichte, стр. 141-201. Springer, (1982)Complexity Analysis of the Bivariate Buchberger Algorithm in Theorema., и . ICMS, том 8592 из Lecture Notes in Computer Science, стр. 41-48. Springer, (2014)The GDML and EuKIM Projects: Short Report on the Initiative.. ICMS, том 9725 из Lecture Notes in Computer Science, стр. 443-446. Springer, (2016)Soft Math Math Soft.. ICMS, том 8592 из Lecture Notes in Computer Science, стр. 9-15. Springer, (2014)Computational Origami Construction of a Regular Heptagon with Automated Proof of Its Correctness., , , , и . Automated Deduction in Geometry, том 3763 из Lecture Notes in Computer Science, стр. 19-33. Springer, (2004)Artificial Intelligence -- Eine Einführung, , , , , , , , и . Teubner, Stuttgart, (1984)Gröbner Bases in Mathematica: Enthusiasm and Frustration.. Programming Environments for High-Level Scientific Problem Solving, том A-2 из IFIP Transactions, стр. 119-132. North-Holland, (1991)General polynomial reduction with TH 9 OREM 8 functors: applications to integro-differential operators and polynomials., , , и . ACM Commun. Comput. Algebra, 42 (3): 135-137 (2008)Theorema 2.0: Computer-Assisted Natural-Style Mathematics., , , , и . J. Formaliz. Reason., 9 (1): 149-185 (2016)Bemerkung zu den Reduzierbarkeitskriterien vonR.Albrecht für das Optimum-Mix-Problem.. Z. Oper. Research, 16 (3): 137-143 (1972)