enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Computational number theory - Wikipedia

    en.wikipedia.org/wiki/Computational_number_theory

    In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of computational methods for investigating and solving problems in number theory and arithmetic geometry, including algorithms for primality testing and integer factorization, finding solutions to diophantine equations, and explicit methods in arithmetic geometry. [1]

  3. Algorithmic Number Theory Symposium - Wikipedia

    en.wikipedia.org/wiki/Algorithmic_Number_Theory...

    Algorithmic Number Theory Symposium (ANTS) is a biennial academic conference, first held in Cornell in 1994, constituting an international forum for the presentation of new research in computational number theory. They are devoted to algorithmic aspects of number theory, including elementary number theory, algebraic number theory, analytic ...

  4. List of number theory topics - Wikipedia

    en.wikipedia.org/wiki/List_of_number_theory_topics

    Download as PDF; Printable version; ... Square-free. Square-free integer; ... Computational number theory is also known as algorithmic number theory. Residue number ...

  5. Theoretical computer science - Wikipedia

    en.wikipedia.org/wiki/Theoretical_computer_science

    A finite-state automaton from automata theory, a branch of theoretical computer science. Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation.

  6. Geometry of numbers - Wikipedia

    en.wikipedia.org/wiki/Geometry_of_numbers

    Geometry of numbers is the part of number theory which uses geometry for the study of algebraic numbers. Typically, a ring of algebraic integers is viewed as a lattice in R n , {\displaystyle \mathbb {R} ^{n},} and the study of these lattices provides fundamental information on algebraic numbers. [ 1 ]

  7. Introduction to Algorithms - Wikipedia

    en.wikipedia.org/wiki/Introduction_to_Algorithms

    Introduction to Algorithms is a book on computer programming by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.The book is described by its publisher as "the leading algorithms text in universities worldwide as well as the standard reference for professionals". [1]

  8. Number Theory Foundation - Wikipedia

    en.wikipedia.org/wiki/Number_Theory_Foundation

    The NTF funds the Selfridge prize awarded at each Algorithmic Number Theory Symposium (ANTS) [2] [3] and is a regular supporter of several conferences and organizations in number theory, including the Canadian Number Theory Association (CNTA), [4] [5] Women in Numbers (WIN), and the West Coast Number Theory (WCNT) conference. [1]

  9. Basic Number Theory - Wikipedia

    en.wikipedia.org/wiki/Basic_Number_Theory

    Basic Number Theory is an influential book [1] by André Weil, an exposition of algebraic number theory and class field theory with particular emphasis on valuation-theoretic methods. Based in part on a course taught at Princeton University in 1961–62, it appeared as Volume 144 in Springer's Grundlehren der mathematischen Wissenschaften ...