268 search results - page 18 / 54 » Recursion Theoretic Operators for Function Complexity Classe... |
148
click to vote
AUTOMATICA
2002
15 years 4 months ago
2002
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...
137
click to vote
TAPSOFT
1993
Springer
15 years 8 months ago
1993
Springer
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
163
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
151
click to vote
APCSAC
2004
IEEE
15 years 8 months ago
2004
IEEE
We examine secure computing paradigms to identify any new architectural challenges for future general-purpose processors. Some essential security functions can be provided by diffe...
128
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...