2273 search results - page 13 / 455 » On the Expressiveness and Complexity of ATL |
TON
2012
11 years 10 months ago
2012
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...
PODS
2005
ACM
14 years 8 months ago
2005
ACM
We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, constant-tagging, and joins, must produce ...
LICS
1999
IEEE
14 years 21 days ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
TACAS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
SAS
1991
Springer
13 years 12 months ago
1991
Springer
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...