On the Hardness of Set Disjointness and Set Intersection with Bounded Universe

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Goldstein, Isaac; Lewenstein, Moshe; Porat, Ely

Journal title: 30th International Symposium on Algorithms and Computation, {ISAAC} 2019

Journal number: 2

Journal publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"

Published year: 2019

DOI identifier: 10.4230/lipics.isaac.2019.7