The Computational Complexity of Subclasses of Semiperfect Rings

This paper studies the computational complexity of subclasses of semiperfect rings from the perspective of computability theory. A ring is semiperfect if the identity can be expressed as a sum of mutually orthogonal local idempotents. Semisimple rings and local rings are typical subclasses of semipe...

Full description

Bibliographic Details

Published in:	Mathematics (Basel) Vol. 12; no. 22; p. 3608
Main Author:	Wu, Huishan
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.11.2024
Subjects:	Algebra Complexity computability theory computational complexity local ring Mathematics Rings (mathematics) semiperfect ring semisimple ring Sums Canada Germany
ISSN:	2227-7390, 2227-7390
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!