Sciweavers

208 search results - page 12 / 42
» Arithmetic Operations in the Polynomial Modular Number Syste...
Sort
View
AAECC
2008
Springer
83views Algorithms» more  AAECC 2008»
13 years 7 months ago
Fast separable factorization and applications
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 ...
Grégoire Lecerf
JC
2008
90views more  JC 2008»
13 years 7 months ago
On the probability distribution of data at points in real complete intersection varieties
We show several estimates on the probability distribution of some data at points in real complete intersection varieties: norms of real affine solutions, condition number of real ...
Cruz E. Borges, Luis M. Pardo
TCS
2008
13 years 7 months ago
Nondeterministic polynomial time factoring in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, Previously I presented ways to compute arithmetic functions, such as addition and multiplic...
Yuriy Brun
MOC
2011
13 years 2 months ago
Computing systems of Hecke eigenvalues associated to Hilbert modular forms
We utilize effective algorithms for computing in the cohomology of a Shimura curve together with the Jacquet-Langlands correspondence to compute systems of Hecke eigenvalues assoc...
Matthew Greenberg, John Voight
BIRTHDAY
2009
Springer
14 years 2 months ago
Polynomial Precise Interval Analysis Revisited
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
Thomas Gawlitza, Jérôme Leroux, Jan R...