{ "items" : [
    { "id" : "http://dbpedia.org/resource/Cook–Levin_theorem"
      "properties" : {
        "http://www.w3.org/2000/01/rdf-schema#comment" : [ "In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete."] } } }
