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.
Clone Membership Problem (CLO)<br />
INPUT: An algebra A <strong>and</strong> an operation g : A k → A.<br />
QUESTION: Is g ∈ Clo A?<br />
Obvious algorithm: Determine whether g ∈ Sg A(Ak )(pr k 1 , . . . , pr k k ).<br />
The running time is bounded by a polynomial in ||A (Ak) ||.<br />
Ross Willard (Waterloo) <strong>Algebra</strong> <strong>and</strong> <strong>Complexity</strong> Třešť, September 2008 12 / 31