The ideal membership problem and polynomial identity testing
type: Item
instance of: scholarly article
title: The ideal membership problem and polynomial identity testing
zbMATH Open document ID: 1190.68027
author: Vikraman Arvind
author: Partha Mukhopadhyay
published in: Information and Computation
publication date: 2010-04-08T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 13F20
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 5690787
zbMATH Keywords: arithmetic circuits
zbMATH Keywords: ideal membership
zbMATH Keywords: polynomial identity testing
MaRDI profile type: Publication
full work available at URL: j.ic.2009.06.003
OpenAlex ID: W2034027554
cites work: Primality and identity testing via Chinese remaindering
cites work: PRIMES is in P
cites work: Q4230322
cites work: Q4230321
cites work: The Monomial Ideal Membership Problem and Polynomial Identity Testing
cites work: Q4023642
cites work: Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
cites work: Derandomizing polynomial identity tests means proving circuit lower bounds
cites work: Polynomial identity testing for depth 3 circuits
cites work: Algebraic methods for interactive proof systems
cites work: Q3891767
cites work: The complexity of the word problems for commutative semigroups and polynomial ideals
cites work: Matching is as easy as matrix inversion
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: IP = PSPACE
DOI: 10.1016/J.IC.2009.06.003
description: scientific article; zbMATH DE number 5690787