Sciweavers

Share
85 search results - page 1 / 17
» On Small Hard Leaf Languages
Sort
View
MFCS
2005
Springer
12 years 5 months ago
On Small Hard Leaf Languages
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 â...
Falk Unger
FSTTCS
2008
Springer
12 years 27 days ago
Leaf languages and string compression
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...
Markus Lohrey
RV
2010
Springer
157views Hardware» more  RV 2010»
11 years 10 months ago
Copilot: A Hard Real-Time Runtime Monitor
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...
Lee Pike, Alwyn Goodloe, Robin Morisset, Sebastian...
CORR
2008
Springer
118views Education» more  CORR 2008»
11 years 12 months ago
A Logic Programming Framework for Combinational Circuit Synthesis
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...
Paul Tarau, Brenda Luderman
FSTTCS
2006
Springer
12 years 3 months ago
Some Results on Average-Case Hardness Within the Polynomial Hierarchy
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...
Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran
books