Co-NP
In computational complexity theory, co-NP is a complexity class. A decision problem is a member of co-NP if and only if its complement is in the complexity class NP. Instances of decision problems in co-NP are sometimes called "counterexamples". In simple terms, co-NP is the class of problems for which efficiently verifiable proofs of "no" instances exist. Equivalently, co-NP is the set of decision problems where the "no" instances can be solved in polynomial time by a theoretical non-deterministic Turing machine.
Co-NP
In computational complexity theory, co-NP is a complexity class. A decision problem is a member of co-NP if and only if its complement is in the complexity class NP. Instances of decision problems in co-NP are sometimes called "counterexamples". In simple terms, co-NP is the class of problems for which efficiently verifiable proofs of "no" instances exist. Equivalently, co-NP is the set of decision problems where the "no" instances can be solved in polynomial time by a theoretical non-deterministic Turing machine.
has abstract
25بك المحتوى هنا ينقصه الاستشه ...... ل-NP أي : co-NP={0,1}* \ NP .
@ar
En informatique théorique, co- ...... a complexité) de la classe NP.
@fr
En teoría de la complejidad co ...... NP-completo puede estar en NP.
@es
In computational complexity th ...... subset have a non-zero sum?".
@en
In der Komplexitätstheorie bez ...... aschine überprüft werden kann.
@de
Klasa Co-NP – klasa złożoności ...... tronę nie została udowodniona.
@pl
Na Teoria da complexidade, co- ...... algoritmo em tempo polinomial.
@pt
Nella teoria della complessità ...... roposito dell'uguaglianza ed .
@it
co-NPとは計算量理論における問題クラスの一つである。
@ja
В теории алгоритмов часто расс ...... зыков из NP, называемый co-NP.
@ru
Wikipage page ID
Wikipage revision ID
730,611,823
subject
comment
25بك المحتوى هنا ينقصه الاستشه ...... ل-NP أي : co-NP={0,1}* \ NP .
@ar
En informatique théorique, co- ...... a complexité) de la classe NP.
@fr
En teoría de la complejidad co ...... P-completo podría estar en NP.
@es
In computational complexity th ...... -deterministic Turing machine.
@en
In der Komplexitätstheorie bez ...... aschine überprüft werden kann.
@de
Klasa Co-NP – klasa złożoności ...... tronę nie została udowodniona.
@pl
Na Teoria da complexidade, co- ...... eto,caso contrário NP = co-NP.
@pt
Nella teoria della complessità ...... rebbe arrestare mentre se ed .
@it
co-NPとは計算量理論における問題クラスの一つである。
@ja
В теории алгоритмов часто расс ...... зыков из NP, называемый co-NP.
@ru
label
Co-NP
@ar
Co-NP
@de
Co-NP
@en
Co-NP
@es
Co-NP
@fr
Co-NP
@it
Co-NP
@ja
Co-NP
@pt
Klasa Co-NP
@pl
Класс co-NP
@ru