408 search results - page 1 / 82 » Quantitative Models and Implicit Complexity |
FSTTCS
2005
Springer
13 years 10 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
IV
2005
IEEE
13 years 10 months ago
2005
IEEE
This paper describes a technology for modelling and rendering heterogeneous objects containing entities of various dimensionalities within a cellular-functional framework based on...
TCS
2011
12 years 11 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
WSCG
2004
13 years 6 months ago
2004
Recent research has demonstrated the effectiveness of complex skeletal primitives such as subdivision curves and surfaces in implicit surface modeling. This paper presents a hiera...
IANDC
2006
13 years 4 months ago
2006
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...