1092 search results - page 26 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
SIGCSE
2005
ACM
15 years 5 months ago
2005
ACM
Many instructors use program runtimes to illustrate and reinforce algorithm complexity concepts. Hardware, operating system and compilers have historically influenced runtime resu...
STOC
1996
ACM
15 years 3 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
ESANN
2006
15 years 1 months ago
2006
Abstract. Response surfaces are a powerful tool for both classification and regression as they are able to model many different phenomena and construct complex boundaries between c...
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...
GIS
2008
ACM
15 years 25 days ago
2008
ACM
One of the formalisms to qualitatively describe polylines in the plane are double-cross matrices. In a double-cross matrix the relative position of any two line segments in a poly...