A finite set of functions with an EXPTIME-complete composition problem

We exhibit a finite family of functions over a finite set (i.e. a finite algebra) such that the problem whether a given function can be obtained as a composition of the members of this family (i.e. is a member of the clone generated by the algebra) is EXPTIME-complete.

• Type: Journal
• Year: 2008
• Where: TCS
• Authors: Marcin Kozik
• Keywords: Finite Algebra, Finite Family, TCS 2008, Theoretical Computer Science