Algorithmic complexity of algebraic systems
From MaRDI portal
See the review in Zbl 0664.03032.
Cites work
Cited in
(13)- Issues of algorithmics and Glushkov's systems of algorithmic algebras
- Computability of distributive lattices
- On recursively enumerable structures
- Degree spectra of structures
- Learning families of algebraic structures from informant
- Effective categoricity for distributive lattices and Heyting algebras
- Complexity of the normalization of algebras
- Well-Quasi Orders and Hierarchy Theory
- scientific article; zbMATH DE number 7295748 (Why is no real title available?)
- scientific article; zbMATH DE number 3933053 (Why is no real title available?)
- Decidability of classes of algebraic systems in polynomial time
- Computable embeddability for algebraic structures
- On the main scientific achievements of Victor Selivanov
This page was built for publication: Algorithmic complexity of algebraic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121875)