Sciweavers

71 search results - page 2 / 15
» Automorphisms of Finite Rings and Applications to Complexity...
Sort
View
ALGOSENSORS
2006
Springer
13 years 9 months ago
Self-deployment Algorithms for Mobile Sensors on a Ring
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
CORR
2008
Springer
132views Education» more  CORR 2008»
13 years 5 months ago
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
Gábor Ivanyos, Marek Karpinski, Lajos R&oac...
PKC
2012
Springer
234views Cryptology» more  PKC 2012»
11 years 7 months ago
Ring-LWE in Polynomial Rings
Abstract. The Ring-LWE problem, introduced by Lyubashevsky, Peikert, and Regev (Eurocrypt 2010), has been steadily finding many uses in numerous cryptographic applications. Still,...
Léo Ducas, Alain Durmus
CASC
2006
Springer
106views Mathematics» more  CASC 2006»
13 years 9 months ago
Simplicial Perturbation Techniques and Effective Homology
In this paper, we deal with the problem of the computation of the homology of a finite simplicial complex after an "elementary simplicial perturbation" process such as th...
Rocío González-Díaz, Bel&eacu...
ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
13 years 5 months ago
Sharp Quantum versus Classical Query Complexity Separations
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
J. Niel de Beaudrap, Richard Cleve, John Watrous