Author:
Koppenhagen Ulla,Mayr Ernst W.
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference24 articles.
1. Some algorithmic problems for finitely defined commutative semigroups;Biryukov;Siberian Math. J.,1967
2. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal;Buchberger,1965
3. Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors;Dickson;Amer. J. Math.,1913
4. The structure of polynomial ideals and Gröbner bases;Dubé;SIAM J. Comput.,1990
5. Rational sets in commutative monoids;Eilenberg;J. Algebra,1969
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Slice closures of indexed languages and word equations with counting constraints;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Complexity of Membership Problems of Different Types of Polynomial Ideals;Algorithmic and Experimental Methods in Algebra, Geometry, and Number Theory;2017