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

Authors:
Marcin Kozik
Affiliations:
Algorithmics Research Group, Jagiellonian University, Gronostajowa 3, 30-387 Kraków, Poland and Eduard ech Center, Charles University, Sokolovska 83, 186 75 Praha 8, Czech Republic
Venue:
Theoretical Computer Science
Year:
2008

Citing 4
Cited 2

The complexity of searching implicit graphs

Artificial Intelligence
GO Is Polynomial-Space Hard

Journal of the ACM (JACM)
Alternation

Journal of the ACM (JACM)
Lower bounds for natural proof systems

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science

Testing expressibility is hard

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Finite combinatory logic with intersection types

TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications

Quantified Score

Hi-index	5.23

Visualization

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.