85 search results - page 1 / 17 » On Small Hard Leaf Languages |
MFCS
2005
Springer
13 years 9 months ago
2005
Springer
This paper deals with balanced leaf language complexity classes, introduced independently in [1] and [14]. We propose the seed concept for leaf languages, which allows us to give â...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
Tight connections between leafs languages and strings compressed via straight-line programs (SLPs) are established. It is shown that the compressed membership problem for a languag...
RV
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We address the problem of runtime monitoring for hard realtime programs—a domain in which correctness is critical yet has largely been overlooked in the runtime monitor...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...