Sciweavers

2766 search results - page 62 / 554
» Algorithms for trigonometric polynomials
Sort
View
LATIN
2010
Springer
15 years 7 months ago
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
Mark van Hoeij, Andrew Novocin
TSP
2008
116views more  TSP 2008»
15 years 19 days ago
Fast Blind Separation of Long Mixture Recordings Using Multivariate Polynomial Identification
This correspondence presents new approaches for optimizing kurtosis-based separation criteria in the case of long mixture recordings. Our methods are based on a multivariate polyno...
Johan Thomas, Yannick Deville, Shahram Hosseini
117
Voted
MICS
2007
100views more  MICS 2007»
15 years 7 days ago
A New Method for Real Root Isolation of Univariate Polynomials
A new algorithm for real root isolation of univariate polynomials is proposed, which is mainly based on exact interval arithmetic and bisection method. Although exact interval arit...
Ting Zhang, Bican Xia
63
Voted
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 10 months ago
On the Structure of Cubic and Quartic Polynomials
In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the foll...
Elad Haramaty and Amir Shpilka
PKC
2007
Springer
165views Cryptology» more  PKC 2007»
15 years 6 months ago
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
Noboru Kunihiro, Kaoru Kurosawa