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.
Attributes | Values |
---|---|
rdfs:label |
|
rdfs:comment |
|
dcterms:subject | |
Wikipage page ID |
|
Wikipage revision ID |
|
Link from a Wikipage to another Wikipage | |
sameAs | |
dbp:wikiPageUsesTemplate | |
has abstract |
|
prov:wasDerivedFrom | |
page length (characters) of wiki page |
|
foaf:isPrimaryTopicOf | |
is Link from a Wikipage to another Wikipage of | |
is Wikipage redirect of | |
is foaf:primaryTopic of |