About: isa:140314316   Sponge Permalink

An Entity of Type : prov:Entity, within Data Space : webisadb.webdatacommons.org associated with source dataset(s)

AttributesValues
rdf:type
prov:value
  • Unless it is an axiom that P!=NP, any proof of P!=NP has to beessentially be of the form:f solves SAT -> f in Cf in C -> f cannot be computed in polynomial time.Therefore, f solves SAT -> f cannot be computed in polynomial time.The Razborov-Rudich paper on Natural Proofs" essentially shows thatif (1) C is a property that is common (Largeness) and (2) it is easyto check whether a function f has pr
prov:wasQuotedFrom
is prov:wasDerivedFrom of
Alternative Linked Data Views: 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] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software