Sciweavers

461 search results - page 17 / 93
» Practical polynomial factoring in polynomial time
Sort
View
GI
2007
Springer
14 years 1 months ago
On Factoring Arbitrary Integers with Known Bits
: We study the factoring with known bits problem, where we are given a composite integer N = p1p2 . . . pr and oracle access to the bits of the prime factors pi, i = 1, . . . , r. ...
Mathias Herrmann, Alexander May
TCS
2008
13 years 7 months ago
On the complexity of real root isolation using continued fractions
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
ACNS
2009
Springer
113views Cryptology» more  ACNS 2009»
13 years 11 months ago
Fast Packet Classification Using Condition Factorization
Abstract. Rule-based packet classification plays a central role in network intrusion detection systems such as Snort. To enhance performance, these rules are typically compiled int...
Alok Tongaonkar, R. Sekar, Sreenaath Vasudevan
CPHYSICS
2006
103views more  CPHYSICS 2006»
13 years 7 months ago
A band factorization technique for transition matrix element asymptotics
A new method of evaluating transition matrix elements between wave functions associated with orthogonal polynomials is proposed. The technique relies on purely algebraic manipulat...
Emmanuel Perrey-Debain, I. David Abrahams
CORR
2012
Springer
193views Education» more  CORR 2012»
12 years 3 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...