Pagh's problem
id:
pagh-s-problem-265-1743764
title:
Pagh's problem
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm for set intersection
original url:
https://en.wikipedia.org/wiki/Pagh%27s_problem
date created:
date modified:
2021-08-06T21:48:46Z
main entity:
{"identifier":"Q107070673","url":"https://www.wikidata.org/entity/Q107070673"}
image:
fields total:
13
integrity:
14