Sciweavers

1380 search results - page 76 / 276
» A General Polynomial Sieve
Sort
View
ICALP
2005
Springer
14 years 2 months ago
The Polyranking Principle
Although every terminating loop has a ranking function, not every loop has a ranking function of a restricted form, such as a lexicographic tuple of polynomials over program variab...
Aaron R. Bradley, Zohar Manna, Henny B. Sipma
PKC
2005
Springer
114views Cryptology» more  PKC 2005»
14 years 2 months ago
Cryptanalysis of the Tractable Rational Map Cryptosystem
In this paper, we present the cryptanalysis of a public key scheme based on a system of multivariate polynomial equations, the ”tractable rational map” cryptosystem. We show co...
Antoine Joux, Sébastien Kunz-Jacques, Fr&ea...
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
14 years 11 days ago
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
Jianer Chen, Iyad A. Kanj
CCCG
2006
13 years 10 months ago
On the Maximum Span of Fixed-Angle Chains
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
Nadia Benbernou, Joseph O'Rourke
IMAGING
2004
13 years 10 months ago
Maintaining an Accurate Printer Characterization
In this study, the problem of updating a printer characterization in response to systematic changes in print-device characteristics is addressed with two distinct approaches: the ...
David Littlewood, Ganesh Subbarayan