12 relations: AKS primality test, Cambridge University Press, Co-NP-complete, Complement (complexity), Complexity class, Computational complexity theory, Decision problem, Non-deterministic Turing machine, NP (complexity), NP-completeness, P (complexity), Subset sum problem.
AKS primality test
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".
New!!: Co-NP and AKS primality test · See more »
Cambridge University Press
Cambridge University Press (CUP) is the publishing business of the University of Cambridge.
New!!: Co-NP and Cambridge University Press · See more »
In complexity theory, computational problems that are co-NP-complete are those that are the hardest problems in co-NP, in the sense that any problem in co-NP can be reformulated as a special case of any co-NP-complete problem with only polynomial overhead.
New!!: Co-NP and Co-NP-complete · See more »
In computational complexity theory, the complement of a decision problem is the decision problem resulting from reversing the yes and no answers.
New!!: Co-NP and Complement (complexity) · See more »
In computational complexity theory, a complexity class is a set of problems of related resource-based complexity.
New!!: Co-NP and Complexity class · See more »
Computational complexity theory
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.
New!!: Co-NP and Computational complexity theory · See more »
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.
New!!: Co-NP and Decision problem · See more »
Non-deterministic Turing machine
In theoretical computer science, a Turing machine is a theoretical machine that is used in thought experiments to examine the abilities and limitations of computers.
New!!: Co-NP and Non-deterministic Turing machine · See more »
In computational complexity theory, NP (for nondeterministic polynomial time) is a complexity class used to describe certain types of decision problems.
New!!: Co-NP and NP (complexity) · See more »
In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes.
New!!: Co-NP and NP-completeness · See more »
In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class.
New!!: Co-NP and P (complexity) · See more »
Subset sum problem
In computer science, the subset sum problem is an important problem in complexity theory and cryptography.
New!!: Co-NP and Subset sum problem · See more »
Co NP, Co np, CoNP, NP = co-NP problem.