Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7896950> ?p ?o }
Showing triples 1 to 61 of
61
with 100 triples per page.
- Q7896950 subject Q7132792.
- Q7896950 subject Q8488086.
- Q7896950 subject Q8575263.
- Q7896950 subject Q8981903.
- Q7896950 abstract "In mathematics, the unknotting problem is the problem of algorithmically recognizing the unknot, given some representation of a knot, e.g., a knot diagram. There are several types of unknotting algorithms. A major unresolved challenge is to determine if the problem admits a polynomial time algorithm, that is, whether the problem lies in the complexity class P.".
- Q7896950 thumbnail Unknots.svg?width=300.
- Q7896950 wikiPageExternalLink citation.cfm?id=1070432.1070482.
- Q7896950 wikiPageExternalLink 2011-pachner-scg.html.
- Q7896950 wikiPageExternalLink burton11-asymptotic.pdf.
- Q7896950 wikiPageExternalLink Complexity_Zoo.
- Q7896950 wikiPageWikiLink Q1188344.
- Q7896950 wikiPageWikiLink Q141488.
- Q7896950 wikiPageWikiLink Q1444047.
- Q7896950 wikiPageWikiLink Q1503309.
- Q7896950 wikiPageWikiLink Q1528291.
- Q7896950 wikiPageWikiLink Q1554293.
- Q7896950 wikiPageWikiLink Q1636327.
- Q7896950 wikiPageWikiLink Q1709878.
- Q7896950 wikiPageWikiLink Q17295.
- Q7896950 wikiPageWikiLink Q1777486.
- Q7896950 wikiPageWikiLink Q2013160.
- Q7896950 wikiPageWikiLink Q2017498.
- Q7896950 wikiPageWikiLink Q2039192.
- Q7896950 wikiPageWikiLink Q2393193.
- Q7896950 wikiPageWikiLink Q2404489.
- Q7896950 wikiPageWikiLink Q2440495.
- Q7896950 wikiPageWikiLink Q2589609.
- Q7896950 wikiPageWikiLink Q3186905.
- Q7896950 wikiPageWikiLink Q343171.
- Q7896950 wikiPageWikiLink Q3777935.
- Q7896950 wikiPageWikiLink Q395.
- Q7896950 wikiPageWikiLink Q3977889.
- Q7896950 wikiPageWikiLink Q4129926.
- Q7896950 wikiPageWikiLink Q42344.
- Q7896950 wikiPageWikiLink Q441579.
- Q7896950 wikiPageWikiLink Q4686387.
- Q7896950 wikiPageWikiLink Q4800823.
- Q7896950 wikiPageWikiLink Q5535513.
- Q7896950 wikiPageWikiLink Q564426.
- Q7896950 wikiPageWikiLink Q628036.
- Q7896950 wikiPageWikiLink Q6295411.
- Q7896950 wikiPageWikiLink Q6402652.
- Q7896950 wikiPageWikiLink Q65082.
- Q7896950 wikiPageWikiLink Q652525.
- Q7896950 wikiPageWikiLink Q6554389.
- Q7896950 wikiPageWikiLink Q685140.
- Q7896950 wikiPageWikiLink Q7122049.
- Q7896950 wikiPageWikiLink Q7132792.
- Q7896950 wikiPageWikiLink Q7144893.
- Q7896950 wikiPageWikiLink Q7661882.
- Q7896950 wikiPageWikiLink Q7896949.
- Q7896950 wikiPageWikiLink Q7922775.
- Q7896950 wikiPageWikiLink Q841545.
- Q7896950 wikiPageWikiLink Q846354.
- Q7896950 wikiPageWikiLink Q8488086.
- Q7896950 wikiPageWikiLink Q849798.
- Q7896950 wikiPageWikiLink Q8575263.
- Q7896950 wikiPageWikiLink Q8981903.
- Q7896950 comment "In mathematics, the unknotting problem is the problem of algorithmically recognizing the unknot, given some representation of a knot, e.g., a knot diagram. There are several types of unknotting algorithms. A major unresolved challenge is to determine if the problem admits a polynomial time algorithm, that is, whether the problem lies in the complexity class P.".
- Q7896950 label "Unknotting problem".
- Q7896950 depiction Unknots.svg.