Decidability of classes of algebraic systems in polynomial time

DOI10.1070/SM2002V193N02ABEH000625MaRDI QIDQ4807234zbMATH OpenOpenAlexFDO

Authors M. I. Anokhin

Publication date 14 July 2003

Published in Sbornik: Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1070/sm2002v193n02abeh000625

zbMATH Keywords

universal algebras

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic structures (08A99) Varieties (08B99)

Recommendations

• scientific article; zbMATH DE number 4085634
• Algorithmic complexity of algebraic systems
• scientific article; zbMATH DE number 3933053
• scientific article; zbMATH DE number 3959413
• Definable Subsets of Polynomial-Time Algebraic Structures
• scientific article; zbMATH DE number 3841851
• Computation over algebraic structures and a classification of undecidable problems
• Computational complexity in algebraic systems
• scientific article; zbMATH DE number 1567883
• scientific article; zbMATH DE number 1557989

Cited in

(2)

• Deciding equivalence of separated non-nested attribute systems in polynomial time
• Decidability of the restricted theories of a class of partial orders

This page was built for publication: Decidability of classes of algebraic systems in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4807234)