1092 search results - page 25 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
133
click to vote
AAECC
2007
Springer
16 years 5 days ago
2007
Springer
Abstract. We review a binary sequence based on the generalized cyclotomy of order 2 with respect to p3 , where p is an odd prime. Linear complexities, minimal polynomials and autoc...
153
click to vote
EOR
2008
15 years 6 months ago
2008
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...
194
click to vote
FOCS
1991
IEEE
15 years 9 months ago
1991
IEEE
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
157
click to vote
CASC
2010
Springer
15 years 4 months ago
2010
Springer
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
137
click to vote
ATAL
2003
Springer
15 years 9 months ago
2003
Springer
One of the factors holding back the application of multiagent, distributed approaches to large-scale sensor interpretation and diagnosis problems is the lack of good techniques fo...