A critical-pair/completion algorithm for finitely generated ideals in rings-Reference-Cited by-同舟云学术

A critical-pair/completion algorithm for finitely generated ideals in rings

Published:1984 Issue: Volume: Page:137-161
ISSN:0302-9743
Container-title:Logic and Machines: Decision Problems and Complexity
language:
Short-container-title:

Author:

Buchberger B.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-13331-3_39.pdf

Reference32 articles.

1. Ayoub, C. W., 81: On Constructing Bases for Ideals in Polynomial Rings over the Integers. The Pennsylvania State University, Dept. of Mathematics, Report Nr. 8184, 1981, submitted to publication.

2. Ballantyne, A. M., Lankford, D. S., 81: New Decision Algorithms for Finitely Presented Commutative Semigroups. Comp. and Maths. with Appls. 7 (1981), 159–165.

3. Bauer, G., 81: The Representation of Monoids by Confluent Rule Systems. University of Kaiserlautern, FRG, Fachbereich Informatik, Ph.D. Thesis, 1981.

4. Bergman, G. M., 78: The Diamond Lemma for Ring Theory. Adv. Math. 29, (1978), 178–218.

5. Buchberger, B., 65: An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal (German). Univ. of Innsbruck, Austria, Math. Inst., Ph.D. Thesis, 1965.

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Meta-heuristics, Machine Learning, and Deep Learning Methods;Evolutionary Approach to Machine Learning and Deep Neural Networks;2018

2. A survey on signature-based algorithms for computing Gröbner bases;Journal of Symbolic Computation;2017-05

3. A search-based procedure for nonlinear real arithmetic;Formal Methods in System Design;2016-04-20

4. Mathematical Theory Exploration in Theorema: Reduction Rings;Lecture Notes in Computer Science;2016

5. Automated Reasoning in Reduction Rings Using the Theorema System;Computer Algebra in Scientific Computing;2015