Sciweavers

844 search results - page 13 / 169
» Solving the p
Sort
View
ANTS
2004
Springer
111views Algorithms» more  ANTS 2004»
15 years 3 months ago
A Method to Solve Cyclotomic Norm Equations
We present a technique to recover f ∈ Q(ζp) where ζp is a primitive pth root of unity for a prime p, given its norm g = f ∗ ¯f in the totally real field Q(ζp + ζ−1 p )....
Nick Howgrave-Graham, Michael Szydlo
CRYPTO
2009
Springer
82views Cryptology» more  CRYPTO 2009»
15 years 4 months ago
Solving Hidden Number Problem with One Bit Oracle and Advice
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
Adi Akavia
MOC
2010
14 years 4 months ago
Midpoint criteria for solving Pell's equation using the nearest square continued fraction
We derive midpoint criteria for solving Pell's equation x2 -Dy2 =
Keith R. Matthews, John P. Robertson, Jim White
AIPS
1998
14 years 11 months ago
Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems
Westudytheruntimeprofilesofcompletebacktrackstylesearchmethodsappliedtohardschedulingproblems.Suchsearchmethodsoftenexhibita largevariabilityinperformanceduetothenon-standardnatur...
Carla P. Gomes, Bart Selman, Ken McAloon, Carol Tr...
TPDS
2008
88views more  TPDS 2008»
14 years 9 months ago
A Two-Hop Solution to Solving Topology Mismatch
The efficiency of Peer-to-Peer (P2P) systems is largely dependent on the overlay constructions. Due to the random selection of logical neighbors, there often exists serious topolog...
Yunhao Liu