The complexity of equivalence for commutative rings

DOI10.1016/S0747-7171(08)80053-3zbMATH Open0724.68050MaRDI QIDQ758209FDOQ758209

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

Publication date: 1990

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

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

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)

Cites Work

• Title not available (Why is that?)
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Title not available (Why is that?)
• The complexity of theorem-proving procedures
• On the computational power of pushdown automata
• Title not available (Why is that?)
• Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic Structures with Hard Equivalence and Minimization Problems
• The Complexity of Very Simple Boolean Formulas with Applications
• Title not available (Why is that?)
• Nonlinear Algebra and Optimization on Rings are “Hard”

Cited In (20)

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