Metadata
Author: ParaCrawl Corpus
Data
English[en]
Equivalently, co-NP is the set of decision problems where the "no" instances can be accepted in polynomial time by a non-deterministic Turing machine.
Swedish[sv]
NP betecknar mängden av beslutsproblem som kan lösas i polynomiell tid av en icke-deterministisk Turingmaskin.