Co-NP-complete
id:
co-np-complete-288-5332242
title:
Co-NP-complete
text:
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. If P is different from co-NP, then all of the co-NP-complete problems are not solvable in polynomial time. If there exists a way to solve a co-NP-complete problem quickly, then that algorithm can be used to solve all co-NP problems quickly. Ea
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Co-NP-complete
date created:
date modified:
2021-05-06T23:34:15Z
main entity:
{"identifier":"Q1142354","url":"https://www.wikidata.org/entity/Q1142354"}
image:
fields total:
13
integrity:
13