Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T09:57:45.103Z Has data issue: false hasContentIssue false

THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS

Published online by Cambridge University Press:  09 December 2011

GÁBOR HORVÁTH*
Affiliation:
Institute of Mathematics, University of Debrecen, Pf. 12, Debrecen, 4010, Hungary e-mail: ghorvath@science.unideb.hu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We investigate the complexity of the equivalence problem over a finite ring when the input polynomials are written as sum of monomials. We prove that for a finite ring if the factor by the Jacobson radical can be lifted in the centre, then this problem can be solved in polynomial time. This result provides a step in proving a dichotomy conjecture of Lawrence and Willard (J. Lawrence and R. Willard, The complexity of solving polynomial equations over finite rings (manuscript, 1997)).

Keywords

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 2011