|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 9 keywords
|
|
|
Results
Found 20 publication records. Showing 20 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
85 | Gábor Ivanyos, Marek Karpinski, Nitin Saxena 0001 |
Schemes for deterministic polynomial factoring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings, pp. 191-198, 2009, ACM, 978-1-60558-609-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
grh, schemes, polynomial factoring, representation theory |
48 | S. Ali Miri, V. Kumar Murty |
An Application of Sieve Methods to Elliptic Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INDOCRYPT ![In: Progress in Cryptology - INDOCRYPT 2001, Second International Conference on Cryptology in India, Chennai, India, December 16-20, 2001, Proceedings, pp. 91-98, 2001, Springer, 3-540-43010-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
32 | Zev Klagsbrun, Travis Sherman, James Weigandt |
The Elkies curve has rank 28 subject only to GRH. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. ![In: Math. Comput. 88(316), pp. 837-846, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
32 | David J. Platt |
Numerical computations concerning the GRH. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. ![In: Math. Comput. 85(302), pp. 3009-3027, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
32 | Loïc Grenié, Giuseppe Molteni |
Explicit versions of the prime ideal theorem for Dedekind zeta functions under GRH. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. ![In: Math. Comput. 85(298), pp. 889-906, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
32 | Loïc Grenié, Giuseppe Molteni |
Zeros of Dedekind zeta functions under GRH. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. ![In: Math. Comput. 85(299), pp. 1503-1522, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
32 | Loïc Grenié, Giuseppe Molteni |
Explicit smoothed prime ideals theorems under GRH. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. ![In: Math. Comput. 85(300), pp. 1875-1899, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
32 | Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena 0001 |
Trading GRH for algebra: Algorithms for factoring polynomials and related structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. ![In: Math. Comput. 81(277), pp. 493-531, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
32 | Gaetan Bisson |
Computing endomorphism rings of elliptic curves under the GRH. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Math. Cryptol. ![In: J. Math. Cryptol. 5(2), pp. 101-114, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
32 | Greg Kuperberg |
Knottedness is in NP, modulo GRH ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1112.0845, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
32 | Gaetan Bisson |
Computing endomorphism rings of elliptic curves under the GRH. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2011, pp. 42, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
32 | Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena 0001 |
Trading GRH for algebra: algorithms for factoring polynomials and related structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR08, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
32 | Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena 0001 |
Trading GRH for algebra: algorithms for factoring polynomials and related structures ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0811.3165, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
32 | Orhan Dönmez |
Numerical simulation of rotating accretion disk around the Schwarzschild black hole using GRH code. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 175(2), pp. 902-922, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Sergei Evdokimov 0001 |
Factorization of polynominals over finite fields in subexponential time under GRH. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS ![In: Algorithmic Number Theory, First International Symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994, Proceedings, pp. 209-219, 1994, Springer, 3-540-58691-1. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Dimitar Jetchev, Ramarathnam Venkatesan |
Bits Security of the Elliptic Curve Diffie-Hellman Secret Keys. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2008, 28th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2008. Proceedings, pp. 75-92, 2008, Springer, 978-3-540-85173-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | David Jao, Stephen D. Miller, Ramarathnam Venkatesan |
Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2005, 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005, Proceedings, pp. 21-40, 2005, Springer, 3-540-30684-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
random reducibility, modular forms, L-functions, generalized Riemann hypothesis, elliptic curves, expanders, Ramanujan graphs, isogenies, rapid mixing, discrete log |
24 | Vikraman Arvind, Piyush P. Kurur |
On the Complexity of Computing Units in a Number Field. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS ![In: Algorithmic Number Theory, 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings, pp. 72-86, 2004, Springer, 3-540-22156-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Jean Marc Couveignes, Thierry Henocq |
Action of Modular Correspondences around CM Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS ![In: Algorithmic Number Theory, 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002, Proceedings, pp. 234-243, 2002, Springer, 3-540-43863-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | J. Maurice Rojas |
On the Complexity of Diophantine Geometry in Low Dimensions (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 3, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #20 of 20 (100 per page; Change: )
|
|