1225 search results - page 97 / 245 » The Instance Complexity Conjecture |
COOPIS
2000
IEEE
14 years 21 days ago
2000
IEEE
The focus of traditional workflow management systems is on control flow within one process definition, that describes how a single case (i.e., workflow instance) is handled in isol...
CSR
2008
Springer
13 years 11 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
CCCG
2008
13 years 10 months ago
2008
We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...
CSL
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
JOT
2006
13 years 9 months ago
2006
Framework development is very expensive, not only because of the intrinsic difficulty related to capturing the domain knowledge, but also because of the lack of appropriate method...