A comparison of two algorithms for solving the ideal membership problem for Z[x]

Authors

  • Luis F. Cáceres Duque Universidad de Puerto Rico en Mayagüez.
  • Silvia M. López Gallo Universidad de Puerto Rico en Mayagüez.

DOI:

https://doi.org/10.54104/em.v2i2.1468

Keywords:

membership problem, ideals, polynomials over integers.

Abstract

In this work, we present two algorithms for solving the ideal membership
problem for Z[x]. The rst algorithm was developed by H.
Simmons in [5]. The second algorithm is based on the results presented
by G. Szekeres in [6] about minimal bases for the ideals of a
polynomial ring over an integral domain.

Downloads

Published

2022-11-05 — Updated on 2023-09-28

Versions

Metrics
Views/Downloads
  • Abstract
    118
  • PDF (Español)
    18

Issue

Vol. 2 No. 2 (2021)

Section

Artículos

Metrics