ScholarLens Back to search
2007•Lecture notes in computer scienceRequires access

The Monomial Ideal Membership Problem and Polynomial Identity Testing

V. Arvind, Partha Mukhopadhyay

Open publisher page 19 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Monomial, Monomial ideal, Ideal (ethics), Mathematics, Polynomial, Monomial basis, Bounded function, Constant (computer programming)

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
The Monomial Ideal Membership Problem and Polynomial Identity Testing — Research Paper | ScholarLens