52 relations: AKS primality test, Arthur–Merlin protocol, Avi Wigderson, Boolean circuit, BQP, Chernoff bound, Christos Papadimitriou, Complement (complexity), Computational complexity theory, Conjecture, Decision problem, E (complexity), Exponential decay, EXPTIME, Lance Fortnow, Las Vegas algorithm, László Babai, Leonard Adleman, Low (complexity), Manindra Agrawal, Mathematical constant, Michael Sipser, Monte Carlo algorithm, Neeraj Kayal, Nitin Saxena, Noam Nisan, NP (complexity), NP-completeness, Oracle machine, P/poly, PH (complexity), Polynomial hierarchy, Polynomial identity testing, PostBQP, Postselection, PP (complexity), Primality test, Prime number, Probabilistic Turing machine, Probability, Pseudorandom number generator, Quantum computing, Random oracle, Randomized algorithm, RP (complexity), Russell Impagliazzo, Simon Fraser University, Sipser–Lautemann theorem, Subset, Time complexity, ..., Turing machine, ZPP (complexity). Expand index (2 more) » « Shrink index
The AKS primality test (also known as Agrawal–Kayal–Saxena primality test and cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, computer scientists at the Indian Institute of Technology Kanpur, on August 6, 2002, in a paper titled "PRIMES is in P".
In computational complexity theory, an Arthur–Merlin protocol is an interactive proof system in which the verifier's coin tosses are constrained to be public (i.e. known to the prover too).
Avi Wigderson (אבי ויגדרזון; born 9 September 1956) is an Israeli mathematician and computer scientist.
In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for digital logic circuits.
In computational complexity theory, BQP (bounded-error quantum polynomial time) is the class of decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances.
In probability theory, the Chernoff bound, named after Herman Chernoff but due to Herman Rubin, gives exponentially decreasing bounds on tail distributions of sums of independent random variables.
Christos Harilaos Papadimitriou (Greek: Χρήστος Χαρίλαος Παπαδημητρίου; born August 16, 1949) is a Greek theoretical computer scientist, and professor of Computer Science at Columbia University.
In computational complexity theory, the complement of a decision problem is the decision problem resulting from reversing the yes and no answers.
Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.
In mathematics, a conjecture is a conclusion or proposition based on incomplete information, for which no proof has been found.
In computability theory and computational complexity theory, a decision problem is a problem that can be posed as a yes-no question of the input values.
In computational complexity theory, the complexity class E is the set of decision problems that can be solved by a deterministic Turing machine in time 2O(n) and is therefore equal to the complexity class DTIME(2O(n)).
A quantity is subject to exponential decay if it decreases at a rate proportional to its current value.
In computational complexity theory, the complexity class EXPTIME (sometimes called EXP or DEXPTIME) is the set of all decision problems that have exponential runtime, i.e., that are solvable by a deterministic Turing machine in O(2p(n)) time, where p(n) is a polynomial function of n. In terms of DTIME, We know and also, by the time hierarchy theorem and the space hierarchy theorem, that so at least one of the first three inclusions and at least one of the last three inclusions must be proper, but it is not known which ones are.
Lance Jeremy Fortnow (born August 15, 1963) is a computer scientist known for major results in computational complexity and interactive proof systems.
In computing, a Las Vegas algorithm is a randomized algorithm that always gives correct results; that is, it always produces the correct result or it informs about the failure.
László "Laci" Babai (born July 20, 1950 in Budapest) from Babai's web site, retrieved 2016-01-28.
Leonard Adleman (born December 31, 1945) is an American computer scientist.
In computational complexity theory, a language B (or a complexity class B) is said to be low for a complexity class A (with some reasonable relativized version of A) if AB.
Manindra Agrawal (born 20 May 1966) is a professor at the Department of Computer Science and Engineering and the Deputy Director at the Indian Institute of Technology, Kanpur.
A mathematical constant is a special number that is "significantly interesting in some way".
Michael Fredric Sipser (born September 17, 1954) is a theoretical computer scientist who has made early contributions to computational complexity theory.
In computing, a Monte Carlo algorithm is a randomized algorithm whose output may be incorrect with a certain (typically small) probability.
Neeraj Kayal (नीरज कयाल) is an Indian computer scientist.
Nitin Saxena (नितिन सक्सेना) (born 3 May 1981) is an Indian scientist in mathematics and theoretical computer science.
Noam Nisan (נעם ניסן; born June 20, 1961) is an Israeli computer scientist, a professor of computer science at the Hebrew University of Jerusalem.
In computational complexity theory, NP (for nondeterministic polynomial time) is a complexity class used to describe certain types of decision problems.
In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes.
In complexity theory and computability theory, an oracle machine is an abstract machine used to study decision problems.
In computational complexity theory, P/poly is the complexity class of languages recognized by a polynomial-time Turing machine with a polynomial-bounded advice function.
In computational complexity theory, the complexity class PH is the union of all complexity classes in the polynomial hierarchy: PH was first defined by Larry Stockmeyer.
In computational complexity theory, the polynomial hierarchy (sometimes called the polynomial-time hierarchy) is a hierarchy of complexity classes that generalize the classes P, NP and co-NP to oracle machines.
In mathematics, polynomial identity testing (PIT) is the problem of efficiently determining whether two multivariate polynomials are identical.
In computational complexity theory, PostBQP is a complexity class consisting of all of the computational problems solvable in polynomial time on a quantum Turing machine with postselection and bounded error (in the sense that the algorithm is correct at least 2/3 of the time on all inputs).
In probability theory, to postselect is to condition a probability space upon the occurrence of a given event.
In complexity theory, PP is the class of decision problems solvable by a probabilistic Turing machine in polynomial time, with an error probability of less than 1/2 for all instances.
A primality test is an algorithm for determining whether an input number is prime.
A prime number (or a prime) is a natural number greater than 1 that cannot be formed by multiplying two smaller natural numbers.
In computability theory, a probabilistic Turing machine is a non-deterministic Turing machine which chooses between the available transitions at each point according to some probability distribution.
Probability is the measure of the likelihood that an event will occur.
A pseudorandom number generator (PRNG), also known as a deterministic random bit generator (DRBG), is an algorithm for generating a sequence of numbers whose properties approximate the properties of sequences of random numbers.
Quantum computing is computing using quantum-mechanical phenomena, such as superposition and entanglement.
In cryptography, a random oracle is an oracle (a theoretical black box) that responds to every unique query with a (truly) random response chosen uniformly from its output domain.
A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic.
In computational complexity theory, randomized polynomial time (RP) is the complexity class of problems for which a probabilistic Turing machine exists with these properties.
Russell Impagliazzo is a professor of computer science at the University of California, San Diego.
Simon Fraser University (SFU) is a public research university in British Columbia, Canada with campuses in Burnaby (Main Campus), Surrey, and Vancouver.
In computational complexity theory, the Sipser–Lautemann theorem or Sipser–Gács–Lautemann theorem states that bounded-error probabilistic polynomial (BPP) time is contained in the polynomial time hierarchy, and more specifically Σ2 ∩ Π2.
In mathematics, a set A is a subset of a set B, or equivalently B is a superset of A, if A is "contained" inside B, that is, all elements of A are also elements of B. A and B may coincide.
In computer science, the time complexity is the computational complexity that describes the amount of time it takes to run an algorithm.
A Turing machine is a mathematical model of computation that defines an abstract machine, which manipulates symbols on a strip of tape according to a table of rules.
In complexity theory, ZPP (zero-error probabilistic polynomial time) is the complexity class of problems for which a probabilistic Turing machine exists with these properties.