514 search results - page 50 / 103 » On the Structure of Valiant's Complexity Classes |
EUROGP
2004
Springer
14 years 13 days ago
2004
Springer
Most programs currently written by humans are object-oriented ones. Two of the greatest benefits of object oriented programming are the separation of interface from implementation,...
CORR
2006
Springer
13 years 8 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...
ECCC
2006
13 years 8 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
ICIP
2000
IEEE
14 years 10 months ago
2000
IEEE
In this paper, we present a class of algorithms that use a partial distance metric to speedup the motion estimation process. The partial distance metric is used within the motion ...
RELMICS
1998
Springer
14 years 27 days ago
1998
Springer
We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms b...