206 search results - page 4 / 42 » Deterministic Caterpillar Expressions |
LICS
1999
IEEE
14 years 2 months 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...
STACS
2004
Springer
14 years 3 months ago
2004
Springer
ICALP
1994
Springer
14 years 1 months ago
1994
Springer
DLT
2008
13 years 11 months ago
2008
ENTCS
2008
13 years 10 months ago
2008
An algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterized type definitions is presented. The algorithm generalizes previous...