COMPUTATIONAL COMPLEXITY OF GENERATORS AND NONGENERATORS IN ALGEBRA
From MaRDI portal
Publication:4791998
DOI10.1142/S0218196702001127zbMATH Open1007.68075DBLPjournals/ijac/BergmanS02WikidataQ60143373 ScholiaQ60143373MaRDI QIDQ4791998FDOQ4791998
Authors: Clifford Bergman, Giora Slutzki 
Publication date: 9 February 2003
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subalgebras, congruence relations (08A30)
Cites Work
- On truth-table reducibility to SAT
- Complete problems for deterministic polynomial time
- Bounded Query Classes
- The strong exponential hierarchy collapses
- Complete sets and the polynomial-time hierarchy
- Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
- Moufang loops of class 2 and cubic forms
- Irreducible elements and uniquely generated algebras
- COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE
- An algorithm for determining \(\Phi(L)\) in finite distributive lattices
- Maximal sublattices of finite distributive lattices
- Deciding Frattini is NP-complete
Cited In (7)
- On the Complexity of Computing Generators of Closed Sets
- Computing generating sets of minimal size in finite algebras
- Non-generators in complete lattices and semilattices
- Algebraic dependence in generating functions and expansion complexity
- Mathematical Foundations of Computer Science 2004
- Title not available (Why is that?)
- The computational complexity of deciding whether a finite algebra generates a minimal variety
This page was built for publication: COMPUTATIONAL COMPLEXITY OF GENERATORS AND NONGENERATORS IN ALGEBRA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4791998)
