checking identities
Recently Published Documents

TOTAL DOCUMENTS

5
(FIVE YEARS 0)

H-INDEX

4
(FIVE YEARS 0)
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

scholarly journals THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS

2006 ◽  
Vol 16 (05) ◽  
pp. 931-939 ◽  
Author(s):  
GÁBOR HORVÁTH ◽  
CSABA SZABÓ
Keyword(s):  
Computational Complexity ◽  
Polynomial Time ◽  
Finite Groups ◽  
Abelian Groups ◽  
Single Equation ◽  
Element Group ◽  
Checking Identities

We analyze the computational complexity of solving a single equation and checking identities over finite meta-abelian groups. Among others we answer a question of Goldmann and Russel from 1998: we prove that it is decidable in polynomial time whether or not an equation over the six-element group S3 has a solution.

Load More ...
Sign in / Sign up

Export Citation Format

Share Document