About: Pagh's problem

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Pagh's problem is a datastructure problem often used when studying lower bounds in computer science named after Rasmus Pagh.Mihai Pătrașcu was the first to give lower bounds for the problem.In 2021 it was shown that, given popular conjectures, the naive linear time algorithm is optimal.

Property Value
dbo:abstract
  • Pagh's problem is a datastructure problem often used when studying lower bounds in computer science named after Rasmus Pagh.Mihai Pătrașcu was the first to give lower bounds for the problem.In 2021 it was shown that, given popular conjectures, the naive linear time algorithm is optimal. (en)
dbo:wikiPageID
  • 67698348 (xsd:integer)
dbo:wikiPageLength
  • 1711 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1037489591 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • Pagh's problem is a datastructure problem often used when studying lower bounds in computer science named after Rasmus Pagh.Mihai Pătrașcu was the first to give lower bounds for the problem.In 2021 it was shown that, given popular conjectures, the naive linear time algorithm is optimal. (en)
rdfs:label
  • Pagh's problem (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License