3145 search results - page 267 / 629 » Algebraic Linear Orderings |
160
click to vote
ARSCOM
2007
15 years 6 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
178
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit ...
184
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
157
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions a...
169
click to vote
FUIN
2006
15 years 6 months ago
2006
Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementary functions over the real numbers in the sense of recursive a...