pith. sign in

arxiv: 1501.04543 · v1 · pith:C3XMJWFCnew · submitted 2015-01-19 · 🧮 math.AC · cs.SC· math.AG

A test for monomial containment

classification 🧮 math.AC cs.SCmath.AG
keywords monomialalgorithmbasescomputationscontainmentcontainsdecidefactorization
0
0 comments X
read the original abstract

We present an algorithm to decide whether a given ideal in the polynomial ring contains a monomial without using Gr\"obner bases, factorization or sub-resultant computations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.