Sciweavers

774 search results - page 4 / 155
» Factors of generalized Fermat numbers
Sort
View
MOC
2002
90views more  MOC 2002»
13 years 6 months ago
Explicit bounds and heuristics on class numbers in hyperelliptic function fields
Abstract. In this paper, we provide tight estimates for the divisor class number of hyperelliptic function fields. We extend the existing methods to any hyperelliptic function fiel...
Andreas Stein, Edlyn Teske
ISSAC
2009
Springer
123views Mathematics» more  ISSAC 2009»
14 years 1 months ago
Schemes for deterministic polynomial factoring
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 6 months ago
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
Bernard Boigelot, Julien Brusten, Véronique...
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
14 years 6 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
ARC
2009
Springer
188views Hardware» more  ARC 2009»
14 years 1 months ago
Word-Length Optimization and Error Analysis of a Multivariate Gaussian Random Number Generator
Abstract. Monte Carlo simulation is one of the most widely used techniques for computationally intensive simulations in mathematical analysis and modeling. A multivariate Gaussian ...
Chalermpol Saiprasert, Christos-Savvas Bouganis, G...