Decidability of classes of algebraic systems in polynomial time
type: Item
instance of: scholarly article
title: Decidability of classes of algebraic systems in polynomial time
zbMATH Open document ID: 1033.68048
author: M. I. Anokhin
published in: Sbornik: Mathematics
publication date: 2003-07-14T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 08A99
Mathematics Subject Classification ID: 08B99
zbMATH DE Number: 1911534
zbMATH Keywords: universal algebras
MaRDI profile type: MaRDI publication profile
full work available at URL: sm2002v193n02abeh000625
OpenAlex ID: W1973109130
DOI: 10.1070/SM2002V193N02ABEH000625
Recommended article: Q3815291
Recommended article: Algorithmic complexity of algebraic systems
Recommended article: Q3708007
Recommended article: Q3727984
Recommended article: Definable Subsets of Polynomial-Time Algebraic Structures
Recommended article: Q3312224
Recommended article: Computation over algebraic structures and a classification of undecidable problems
Recommended article: Computational complexity in algebraic systems
Recommended article: Q4761714
Recommended article: Q4527760
description: scientific article; zbMATH DE number 1911534