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

Isaac Goldstein, Moshe Lewenstein, Ely Porat. On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. In Pinyan Lu, Guochuan Zhang, editors, 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China. Volume 149 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]

Abstract

Abstract is missing.