Sciweavers

1380 search results - page 3 / 276
» A General Polynomial Sieve
Sort
View
ANTS
2004
Springer
111views Algorithms» more  ANTS 2004»
14 years 2 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
ASIACRYPT
2007
Springer
14 years 2 months ago
When e-th Roots Become Easier Than Factoring
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
Antoine Joux, David Naccache, Emmanuel Thomé...
JCT
2000
81views more  JCT 2000»
13 years 8 months ago
Generalized Rook Polynomials
Generalizing the notion of placing rooks on a Ferrers board leads to a new class of combinatorial models and a new class of rook polynomials. Connections are establishedwith absolu...
Jay Goldman, James Haglund
WWW
2008
ACM
14 years 9 months ago
Personalized web exploration with task models
Personalized Web search has emerged as one of the hottest topics for both the Web industry and academic researchers. However, the majority of studies on personalized search focuse...
Jae-wook Ahn, Peter Brusilovsky, Daqing He, Jonath...
EJC
2011
13 years 3 days ago
A Tutte-style proof of Brylawski's tensor product formula
We provide a new proof of Brylawski’s formula for the Tutte polynomial of the tensor product of two matroids. Our proof involves extending Tutte’s formula, expressing the Tutte...
Yuanan Diao, Gábor Hetyei, Kenneth Hinson