Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q155291> ?p ?o }
Showing triples 1 to 26 of
26
with 100 triples per page.
- Q155291 subject Q7298553.
- Q155291 subject Q7451559.
- Q155291 subject Q8250013.
- Q155291 subject Q8804237.
- Q155291 abstract "In computational complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is polynomial in the numeric value of the input, but is exponential in the length of the input – the number of bits required to represent it. An NP-complete problem with known pseudo-polynomial time algorithms is called weakly NP-complete.An NP-complete problem is called strongly NP-complete if it is proven that it cannot be solved by a pseudo-polynomial time algorithm unless P=NP. The strong/weak kinds of NP-hardness are defined analogously.".
- Q155291 wikiPageWikiLink Q1137554.
- Q155291 wikiPageWikiLink Q205084.
- Q155291 wikiPageWikiLink Q215206.
- Q155291 wikiPageWikiLink Q2393193.
- Q155291 wikiPageWikiLink Q269878.
- Q155291 wikiPageWikiLink Q294284.
- Q155291 wikiPageWikiLink Q333464.
- Q155291 wikiPageWikiLink Q43260.
- Q155291 wikiPageWikiLink Q724775.
- Q155291 wikiPageWikiLink Q7298553.
- Q155291 wikiPageWikiLink Q7451559.
- Q155291 wikiPageWikiLink Q746242.
- Q155291 wikiPageWikiLink Q7624684.
- Q155291 wikiPageWikiLink Q7977975.
- Q155291 wikiPageWikiLink Q8250013.
- Q155291 wikiPageWikiLink Q829546.
- Q155291 wikiPageWikiLink Q864457.
- Q155291 wikiPageWikiLink Q8804237.
- Q155291 wikiPageWikiLink Q938821.
- Q155291 comment "In computational complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is polynomial in the numeric value of the input, but is exponential in the length of the input – the number of bits required to represent it. An NP-complete problem with known pseudo-polynomial time algorithms is called weakly NP-complete.An NP-complete problem is called strongly NP-complete if it is proven that it cannot be solved by a pseudo-polynomial time algorithm unless P=NP.".
- Q155291 label "Pseudo-polynomial time".