We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector fo...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...