MFCS
2009
Springer
13 years 11 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
We consider Priority Algorithm [BNR03] as a syntactic model of formulating the concept of greedy algorithm for Job Scheduling, and we study the computation of optimal priority alg...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We recently introduced an extensional model of the pure λcalculus living in a cartesian closed category of sets and relations. In this paper, we provide sufficient condi...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
