2766 search results - page 157 / 554 » Algorithms for trigonometric polynomials |
138
click to vote
ANTS
2008
Springer
15 years 6 months ago
2008
Springer
![Faster Multiplication in GF(2)[x]](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Faster Multiplication in GF(2)[x]")
Abstract. In this paper, we discuss an implementation of various algorithms for multiplying polynomials in GF(2)[x]: variants of the window methods, Karatsuba's, Toom-Cook...
261
click to vote
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
114
click to vote
WAOA
2007
Springer
15 years 10 months ago
2007
Springer
In a buyer-supplier game, a special type of assignment game, a distinguished player, called the buyer, wishes to purchase some combinatorial structure. A set of players, called sup...
121
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
129
click to vote
STOC
2012
ACM
13 years 6 months ago
2012
ACM
We analyze the Schelling model of segregation in which a society of n individuals live in a ring. Each individual is one of two races and is only satisfied with his location so l...