| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438080 | Theoretical Computer Science | 2008 | 12 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
