2766 search results - page 193 / 554 » Algorithms for trigonometric polynomials |
109
click to vote
AAECC
2007
Springer
15 years 10 months 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...
184
click to vote
FAW
2010
Springer
15 years 4 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
147
click to vote
AAECC
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
128
Voted
EOR
2008
15 years 4 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...
359
click to vote
IWOCA
2010
Springer
14 years 11 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...