The complexity of equivalence for commutative rings

DOI10.1016/S0747-7171(08)80053-3MaRDI QIDQ758209zbMATH OpenFDO

Authors H. B. III Hunt, R. E. Stearns

Publication date 1990

Published in Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

commutative ringsstraight-line programsequivalence problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects and applications of commutative rings (13P99) Finite commutative rings (13M99)

Recommendations

• THE EQUIVALENCE PROBLEM OVER FINITE RINGS
• The equivalence problem for finite rings
• On the Computational Complexity of Algebra on Lattices
• The complexity of the equivalence problem over finite rings.
• Algebraic Structures with Hard Equivalence and Minimization Problems

Cites work

• scientific article; zbMATH DE number 3930347 (Why is no real title available?)
• scientific article; zbMATH DE number 3960994 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3204690 (Why is no real title available?)
• scientific article; zbMATH DE number 3246263 (Why is no real title available?)
• scientific article; zbMATH DE number 3351632 (Why is no real title available?)
• scientific article; zbMATH DE number 7716053 (Why is no real title available?)
• Algebraic Structures with Hard Equivalence and Minimization Problems
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Nonlinear Algebra and Optimization on Rings are “Hard”
• On the computational power of pushdown automata
• Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
• The Complexity of Very Simple Boolean Formulas with Applications
• The complexity of theorem-proving procedures

Cited in

(20)

• Complexity issues of checking identities in finite monoids
• An assertion concerning functionally complete algebras and NP-completeness
• Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\).
• scientific article; zbMATH DE number 3889515 (Why is no real title available?)
• Complexity of elements in rings
• THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
• Complexity of the identity checking problem for finite semigroups.
• THE EQUIVALENCE PROBLEM OVER FINITE RINGS
• The complexity of the equivalence problem over finite rings.
• The complexity of the equation solvability problem over semipattern groups
• Satisfiability in MultiValued Circuits
• Identity checking problem for transformation monoids
• Computers and universal algebra: Some directions
• COMPLEXITY OF SEMIGROUP IDENTITY CHECKING
• THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM
• The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
• Evaluation of polynomials over finite rings via additive combinatorics
• COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES
• Some applications of higher commutators in Mal'cev algebras
• The complexity of the equivalence and equation solvability problems over meta-abelian groups

This page was built for publication: The complexity of equivalence for commutative rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758209)