Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

TCS
2008

favoriteEmaildiscussreport

123views Theoretical Computer Science» more TCS 2008»

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

13 years 10 months ago

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

Download www.tcs.uj.edu.pl

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.

Marcin Kozik

Real-time Traffic

Finite Algebra | Finite Family | TCS 2008 | Theoretical Computer Science |

claim paper

Related Content

» Generation of Constants and Synchronization of Finite Automata

» Compositions of Random Functions on a Finite Set

» Composing Schema Mappings SecondOrder Dependencies to the Rescue

» Ranking and Unranking of Hereditarily Finite Functions and Permutations

» Evolutionary Search for Minimal Elements in Partially Ordered Finite Sets

» Coalgebraic Logic and Synthesis of Mealy Machines

» Curvature Guided Level Set Registration Using Adaptive Finite Elements

» Minimization of convex functionals over frame operators

» On Near Optimality of the Set of FiniteState Controllers for Average Cost POMDP

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2008
Where	TCS
Authors	Marcin Kozik

Comments (0)