Computers and universal algebra: Some directions
From MaRDI portal
Publication:1902542
DOI10.1007/BF01200490zbMath0834.08001MaRDI QIDQ1902542
Publication date: 10 April 1996
Published in: Algebra Universalis (Search for Journal in Brave)
surveycomputational complexitypolynomial time algorithmNP-completenessunificationdiscriminator varietyterm rewriting systemsisomorphism problemequivalence problemprincipal congruencesubdirect decompositionsfree spectrasubdirectly irreducible members
Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Software, source code, etc. for problems pertaining to general algebraic systems (08-04) Research exposition (monographs, survey articles) pertaining to general algebraic systems (08-02)
Related Items
ABSTRACT NUMBER SYSTEMS AND LOGICAL LIMIT LAWS, Unification in commutative semigroups, On the complexity of equational decision problems for finite height complemented and orthocomplemented modular lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Free lattice algorithms
- The complexity of equivalence for commutative rings
- Clones satisfying the term condition
- Unification in commutative rings is not finitary
- Finite algebras with large free spectra
- Free lattices in some small varieties
- A computation of the eighth Dedekind number
- Discriminator varieties and symbolic computation
- Effective subdirect decomposition: A case study
- The set of types of a finitely generated variety
- Term rewrite systems for lattice theory
- The equivalence problem for finite rings
- Determining whether a groupoid is a group
- Unification in primal algebras, their powers and their varieties
- Equational Theory of Positive Numbers with Exponentiation
- Algebraic Structures with Hard Equivalence and Minimization Problems
- On the Computational Complexity of Algebra on Lattices
- Finitely Presented Lattices: Canonical Forms and the Covering Relation
- Isomorphism Testing of Unary Algebras
- FINDING TYPE SETS IS NP-HARD
- THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
- SMALL MODELS OF THE HIGH SCHOOL IDENTITIES
- Unification in Varieties of Groups: Nilpotent Varieties
- Tarski's High School Identities
- The complexity of theorem-proving procedures
