mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of computational methods for investigating...

theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage...

three major branches: automata theory and formal languages, computability theory, and computational complexity theory, which are linked by the question:...

algorithmic game theory, machine learning, computational biology, computational economics, computational geometry, and computational number theory and algebra...

group theory Computational geometry Computational number theory Computational topology Computational statistics Algorithmic information theory Algorithmic...

In computer science, computational learning theory (or just learning theory) is a subfield of artificial intelligence devoted to studying the design and...

and certain fast variants of the Schreier–Sims algorithm in computational group theory. For algorithms that are a part of Stochastic Optimization (SO)...

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

Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical...

isogeny graphs are a class of expander graphs that arise in computational number theory and have been applied in elliptic-curve cryptography. Their vertices...

study of computational geometric algorithms, and such problems are also considered to be part of computational geometry. While modern computational geometry...

In mathematics and applied mathematics, perturbation theory comprises methods for finding an approximate solution to a problem, by starting from the exact...

conjecture Znám's problem Note: Computational number theory is also known as algorithmic number theory. Residue number system Cunningham project Quadratic...

prime factors of each number. It was created by RSA Laboratories in March 1991 to encourage research into computational number theory and the practical difficulty...

(2000). A course in computational algebraic number theory. GTM. Vol. 138. Springer. ISBN 3-540-55640-0. Borwein, Peter (2002). Computational Excursions in Analysis...

computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation...

In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where...

heavily based on mathematical theory and computer science practice; cryptographic algorithms are designed around computational hardness assumptions, making...

combinatorial number theory, computational number theory, and applied number theory, which examines the application of number theory to science and technology...

organization, computational devices, the flow of computation, etc. In mathematics, they are useful in geometry and certain parts of topology, e.g. knot theory. Algebraic...

Probability theory or probability calculus is the branch of mathematics concerned with probability. Although there are several different probability interpretations...

Computational thinking (CT) refers to the thought processes involved in formulating problems so their solutions can be represented as computational steps...

topology, or computational topology, is a subfield of topology with an overlap with areas of computer science, in particular, computational geometry and...

discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential...

The quadratic residuosity problem (QRP) in computational number theory is to decide, given integers a {\displaystyle a} and N {\displaystyle N} , whether...

{\displaystyle n} correct digits. Algorithms for number theoretical calculations are studied in computational number theory. The following complexity figures assume...

In number theory, a perfect number is a positive integer that is equal to the sum of its positive proper divisors, that is, divisors excluding the number...

Decision theory or the theory of rational choice is a branch of probability, economics, and analytic philosophy that uses expected utility and probability...

the message Regulation of algorithms Theory of computation Computability theory Computational complexity theory "Definition of ALGORITHM". Merriam-Webster...

In physics, a gauge theory is a type of field theory in which the Lagrangian, and hence the dynamics of the system itself, does not change under local...