Find link

language:

Find link is a tool written by Edward Betts.

searching for Computational number theory 47 found (184 total)

alternate case: computational number theory

Monte Carlo algorithm (1,195 words) [view diff] no match in snippet view article find links to article

In computing, a Monte Carlo algorithm is a randomized algorithm whose output may be incorrect with a certain (typically small) probability. Two examples

Daniel Bleichenbacher (271 words) [view diff] exact match in snippet view article find links to article

received his Ph.D. from ETH Zurich in 1996 for contributions to computational number theory, particularly concerning message verification in the ElGamal

Information Processing Letters (520 words) [view diff] exact match in snippet view article find links to article

parallel algorithms, computational geometry, learning theory, computational number theory, computational biology, coding theory, theoretical cryptography

Herman te Riele (329 words) [view diff] exact match in snippet view article find links to article

Dutch mathematician at CWI in Amsterdam with a specialization in computational number theory. He is known for proving the correctness of the Riemann hypothesis

KANT (software) (178 words) [view diff] case mismatch in snippet view article

G.; Williams, Hugh C. (1991). Computational Number Theory: Proceedings of the Colloquium on Computational Number Theory Held at Kossuth Lajos University

Brigitte Vallée (357 words) [view diff] exact match in snippet view article find links to article

French CNRS at Université de Caen, since 2001 and specialized in computational number theory and analysis of algorithms. Amongst the algorithms she studied

David William Boyd (458 words) [view diff] exact match in snippet view article find links to article

computation, including numerical analysis, symbolic computation, and computational number theory, and also geometric topology, including hyperbolic manifolds

Szpiro's conjecture (826 words) [view diff] case mismatch in snippet view article find links to article

99–109. doi:10.1155/S1073792891000144. Pomerance, Carl (2008). "Computational Number Theory". The Princeton Companion to Mathematics. Princeton University

Stan Wagon (764 words) [view diff] case mismatch in snippet view article find links to article

Schwalbe and Antonin Slavik, Wolfram Research, 2009). A Course in Computational Number Theory (with David Bressoud, Springer, 2000) The Mathematical Explorer

Robert Rumely (375 words) [view diff] exact match in snippet view article find links to article

Mathematical Society "for contributions to arithmetic potential theory, computational number theory, and arithmetic dynamics". "Robert Rumely", Mathematics Department

Paul Zimmermann (mathematician) (505 words) [view diff] exact match in snippet view article

for point-counting on such curves. He is also interested in computational number theory. In particular, he has contributed to some of the record computations

Brun's theorem (1,263 words) [view diff] case mismatch in snippet view article find links to article

constant". Some Results of Computational Research in Prime Numbers (Computational Number Theory). Archived from the original on 8 December 2013. Retrieved 16

Smooth number (1,567 words) [view diff] exact match in snippet view article find links to article

(AMS, 2015) ISBN 978-0821898543 A. Granville, Smooth numbers: Computational number theory and beyond, Proc. of MSRI workshop, 2008 Weisstein, Eric W. "Smooth

Dan Boneh (1,150 words) [view diff] case mismatch in snippet view article find links to article

Cryptography Institutions Stanford University Thesis Studies in Computational Number Theory with Applications to Cryptography (1996) Doctoral advisor Richard

David Bressoud (909 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-0-521-66646-6. Bressoud, David; Wagon, Stan (2000). A Course in Computational Number Theory. New York: Key College Publishing in cooperation with Springer

Elliptic-curve Diffie–Hellman (2,168 words) [view diff] case mismatch in snippet view article find links to article

ladder". In Joppe W. Bos and Arjen K. Lenstra, editors, Topics in Computational Number Theory inspired by Peter L. Montgomery, pages 82–115. Cambridge University

Fermat–Catalan conjecture (655 words) [view diff] case mismatch in snippet view article find links to article

of related conjectures and theorems Pomerance, Carl (2008), "Computational Number Theory", in Gowers, Timothy; Barrow-Green, June; Leader, Imre (eds.)

Check digit (2,415 words) [view diff] case mismatch in snippet view article find links to article

2022-05-22. Retrieved 2022-10-15. David Bressoud, Stan Wagon, "Computational Number Theory", 2000, Key College Publishing "OpenFIGI: Unlock the Power of

Discrete logarithm (2,509 words) [view diff] case mismatch in snippet view article find links to article

Igor; Wang, Huaxiong; Xing, Chaoping (eds.). Cryptography and Computational Number Theory. Progress in Computer Science and Applied Logic (1 ed.). Birkhäuser

Conductor (class field theory) (1,227 words) [view diff] exact match in snippet view article

ISBN 978-0-8218-4426-7, MR 2467155 Cohen, Henri (2000), Advanced topics in computational number theory, Graduate Texts in Mathematics, vol. 193, Springer-Verlag,

Victor Shoup (297 words) [view diff] case mismatch in snippet view article find links to article

University IBM Zurich Research Lab Thesis "Removing Randomness from Computational Number Theory" (1989) Doctoral advisor Eric Bach Website www.shoup.net

N. G. W. H. Beeger (292 words) [view diff] exact match in snippet view article find links to article

research and exchange of ideas in the field of algorithmic and computational number theory. The first Beeger Lecture was delivered in 1992. 2024 Andrew

List of American mathematicians (1,051 words) [view diff] exact match in snippet view article find links to article

(1913–1998) Noam Elkies (b. 1966), mathematical prodigy who works in computational number theory Jerald Ericksen (1924–2021) Alex Eskin (b. 1965), researcher

The Magic Words are Squeamish Ossifrage (716 words) [view diff] case mismatch in snippet view article find links to article

1007/BFb0000440. Retrieved 15 March 2025. Yan, Song Y. (28 November 2012). Computational Number Theory and Modern Cryptography. John Wiley & Sons. pp. 1–. ISBN 978-1-118-18861-3

Lévy's constant (899 words) [view diff] case mismatch in snippet view article find links to article

with Applications to Continued Fractions, UNCG Summer School in Computational Number Theory University of North Carolina Greensboro May 18 - 22, 2020. Lesson

Integer factorization (2,983 words) [view diff] case mismatch in snippet view article find links to article

particular p. 583. David Bressoud and Stan Wagon (2000). A Course in Computational Number Theory. Key College Publishing/Springer. pp. 168–69. ISBN 978-1-930190-10-8

Lucien Szpiro (1,208 words) [view diff] case mismatch in snippet view article find links to article

CS1 maint: unflagged free DOI (link) Pomerance, Carl (2008). "Computational Number Theory". The Princeton Companion to Mathematics. Princeton University

Hugh C. Williams (729 words) [view diff] case mismatch in snippet view article find links to article

with Attila Pethö, Horst-Günter Zimmer, Michael Pohst (Hrsg.): Computational Number Theory. de Gruyter 1991. with J. O. Shallit: Factoring integers before

Lucas pseudoprime (3,584 words) [view diff] case mismatch in snippet view article find links to article

MR 0583518. David Bressoud; Stan Wagon (2000). A Course in Computational Number Theory. New York: Key College Publishing in cooperation with Springer

Randomized algorithm (4,218 words) [view diff] case mismatch in snippet view article find links to article

the Symposium on Numerical Analysis and the Minisymposium on Computational Number Theory held in Vancouver, British Columbia, August 9–13, 1993, Proceedings

Graduate Texts in Mathematics (5,021 words) [view diff] case mismatch in snippet view article find links to article

Gilles Lacombe (1999, ISBN 978-0-387-98524-4) Advanced Topics in Computational Number Theory, Henri Cohen (2000, ISBN 0-387-98727-4) One-Parameter Semigroups

Hermite normal form (1,849 words) [view diff] case mismatch in snippet view article find links to article

form decomposition of an integer matrix m. Cohen, Henri (1999). Advanced Topics in Computational Number Theory. Springer. §1.4.2. ISBN 0-387-98727-4.

Presentation of a group (2,473 words) [view diff] exact match in snippet view article find links to article

― fundamental algorithms from theoretical computer science, computational number theory, and computational commutative algebra, etc. de Cornulier, Yves

Fermi–Dirac prime (864 words) [view diff] case mismatch in snippet view article find links to article

Perfect Powers in Essentially Linear Time, and Other Studies in Computational Number Theory (Doctoral dissertation), University of California, Berkeley Litsyn

Perfect number (5,168 words) [view diff] case mismatch in snippet view article find links to article

65 (3): 121–126. doi:10.4171/EM/149.. Yan, Song Y. (2012), Computational Number Theory and Modern Cryptography, John Wiley & Sons, Section 2.3, Exercise

Prime gap (3,787 words) [view diff] case mismatch in snippet view article find links to article

Some Results of Computational Research in Prime Numbers -- Computational Number Theory. This reference web site includes a list of all first known occurrence

Baillie–PSW primality test (2,526 words) [view diff] case mismatch in snippet view article find links to article

2003.12428566. Bressoud, David; Wagon, Stan (2000). A Course in Computational Number Theory. New York: Key College Publishing in cooperation with Springer

Jennifer Balakrishnan (1,588 words) [view diff] exact match in snippet view article find links to article

class of fellows, "for contributions to arithmetic geometry and computational number theory and service to the profession". She earned the 2022 AWM–Microsoft

Infrastructure (number theory) (2,490 words) [view diff] exact match in snippet view article

field based key exchange protocol. Public-key cryptography and computational number theory (Warsaw, 2000), 89–112, de Gruyter, Berlin, 2001 MR1881630

Abc conjecture (4,588 words) [view diff] case mismatch in snippet view article find links to article

165–186, ISSN 0303-1179, MR 0992208 Pomerance, Carl (2008). "Computational Number Theory". The Princeton Companion to Mathematics. Princeton University

Elliptic curve (8,433 words) [view diff] case mismatch in snippet view article find links to article

Introduction to the Theory of Elliptic Curves" (PDF). Summer School on Computational Number Theory and Applications to Cryptography. University of Wyoming. "LMFDB

NTRUEncrypt (3,890 words) [view diff] case mismatch in snippet view article find links to article

Silverman. Optimizations for NTRU. Public-Key Cryptography and Computational Number Theory (Warsaw, September 11–15, 2000), DeGruyter, to appear. A. C.

Gamma function (13,511 words) [view diff] case mismatch in snippet view article find links to article

Büyükaşşk (2019). Notes from the International Autumn School on Computational Number Theory. Springer. p. 205. ISBN 978-3-030-12558-5. Extract of page 205

Elliptic curve point multiplication (4,325 words) [view diff] case mismatch in snippet view article find links to article

ladder". In Joppe W. Bos and Arjen K. Lenstra, editors, Topics in Computational Number Theory inspired by Peter L. Montgomery, pages 82–115. Cambridge University

Timeline of women in computing (7,019 words) [view diff] exact match in snippet view article find links to article

Gödel Prize for research on complexity theory, cryptography and computational number theory, and the invention of zero-knowledge proofs. Barbara Liskov together

List of women in mathematics (23,148 words) [view diff] exact match in snippet view article find links to article

theorist Kirsten Eisenträger, German-American researcher in computational number theory Tanja Eisner (born 1980), Ukrainian-German expert on operator

List of Brown University alumni (30,888 words) [view diff] exact match in snippet view article find links to article

Professor Emeritus of Mathematics, UC, Berkeley; "father of computational number theory" Katrina Ligett (Sc.B. 2004) – Associate Professor of Computer