Sciweavers

237 search results - page 28 / 48
» MapReduce for Integer Factorization
Sort
View
MOC
2002
70views more  MOC 2002»
13 years 10 months ago
Solving norm equations in relative number fields using S-units
Abstract. In this paper, we are interested in solving the so-called norm equation NL/K(x) = a, where L/K is a given arbitrary extension of number fields and a a given algebraic num...
Denis Simon
ORL
1998
136views more  ORL 1998»
13 years 10 months ago
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
Fabián A. Chudak, Michel X. Goemans, Dorit ...
COCOA
2010
Springer
13 years 9 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
ISAAC
2010
Springer
233views Algorithms» more  ISAAC 2010»
13 years 8 months ago
Computing Sparse Multiples of Polynomials
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
CORR
2012
Springer
193views Education» more  CORR 2012»
12 years 6 months ago
Search versus Decision for Election Manipulation Problems
Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather t...
Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis M...