Universal Algebra and Computational Complexity Lecture 3
Universal Algebra and Computational Complexity Lecture 3
Universal Algebra and Computational Complexity Lecture 3
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Some decision problems involving algebras<br />
INPUT: a finite algebra A.<br />
1 Is A simple? Subdirectly irreducible? Directly indecomposable?<br />
Ross Willard (Waterloo) <strong>Algebra</strong> <strong>and</strong> <strong>Complexity</strong> Třešť, September 2008 5 / 31