OpenLink Software

About: http://dbpedia.org/resource/NP-completeness

 Permalink

an Entity references as follows:

In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. The set of NP-complete problems is often denoted by NP-C or NPC.

Subject of Sentences In Document
Object of Sentences In Document
Explicit Coreferences
Implicit Coreferences
Graph IRICount
http://dbpedia.org3
Faceted Search & Find service v1.13.91

Alternative Linked Data Documents: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] This material is Open Knowledge Creative Commons License Valid XHTML + RDFa
This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.
OpenLink Virtuoso version 07.20.3212 as of Mar 29 2016, on Linux (x86_64-unknown-linux-gnu), Single-Server Edition (68 GB total memory)
Copyright © 2009-2025 OpenLink Software