A comparison of two algorithms for solving the ideal membership problem for Z[x]
In this work, we present two algorithms for solving the ideal membershipproblem for Z[x]. The rst algorithm was developed by H.Simmons in [5]. The second algorithm is based on the results presentedby G. Szekeres in [6] about minimal bases for the ideals of apolynomial ring over an integral domain.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | info:eu-repo/semantics/article |
| Language: | spa |
| Published: |
Universidad Antonio Nariño
2023
|
| Subjects: | |
| Online Access: | https://revistas.uan.edu.co/index.php/espaciomatematico/article/view/1468 https://repositorio.uan.edu.co/handle/123456789/11555 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
