Sciweavers

ANTS
2010
Springer
246views Algorithms» more  ANTS 2010»
15 years 10 months ago
On the Extremality of an 80-Dimensional Lattice
Abstract. We show that a specific even unimodular lattice of dimension 80, first investigated by Schulze-Pillot and others, is extremal (i.e., the minimal nonzero norm is 8). Thi...
Damien Stehlé, Mark Watkins
ANTS
2010
Springer
291views Algorithms» more  ANTS 2010»
15 years 10 months ago
Fixed Points for Discrete Logarithms
: We establish a conjecture of Brizolis that for every prime p > 3 there is a primitive root r and an integer t in the interval [1, p − 1] with logr t = t. Here, logr is the d...
Mariana Levin, Carl Pomerance, K. Soundararajan
ANTS
2010
Springer
252views Algorithms» more  ANTS 2010»
15 years 10 months ago
On a Problem of Hajdu and Tengely
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ...
Samir Siksek, Michael Stoll
ANTS
2010
Springer
260views Algorithms» more  ANTS 2010»
15 years 10 months ago
On the Complexity of the Montes Ideal Factorization Algorithm
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
David Ford, Olga Veres
ANTS
2010
Springer
262views Algorithms» more  ANTS 2010»
15 years 10 months ago
Short Bases of Lattices over Number Fields
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
Claus Fieker, Damien Stehlé
ANTS
2010
Springer
246views Algorithms» more  ANTS 2010»
15 years 10 months ago
Class Invariants by the CRT Method
Andreas Enge, Andrew V. Sutherland
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
15 years 10 months ago
On the Complexity of Boolean Functions in Different Characteristics
Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one c...
Parikshit Gopalan, Shachar Lovett, Amir Shpilka
COCO
2009
Springer
99views Algorithms» more  COCO 2009»
15 years 10 months ago
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution
Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
15 years 10 months ago
Extractors for Low-Weight Affine Sources
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
Anup Rao