18 search results - page 1 / 4 » Working times in atypical forms of employment: the special c... |
CORR
2006
Springer
13 years 4 months ago
2006
Springer
ESOP
2000
Springer
13 years 8 months ago
2000
Springer
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
ECCC
2011
12 years 12 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
WEBDB
2005
Springer
13 years 10 months ago
2005
Springer
Nonrecursive XQuery is known to be hard for nondeterministic exponential time. Thus it is commonly believed that any algorithm for evaluating XQuery has to require exponential amo...