7 search results - page 1 / 2 » Tailoring Recursion to Characterize Non-Deterministic Comple... |
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
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 ...
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...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
IJCV
2000
13 years 4 months ago
2000
The appearance of an object is composed of local structure. This local structure can be described and characterized by a vector of local features measured by local operators such a...