On the complexity of a set-union problem

DOI10.1109/SFCS.1997.646099MaRDI QIDQ7251039zbMATH OpenFDO

Authors Richard J. Lipton, P. J. Martino, Andrew Neitzke

Publication date 21 May 2026

Full work available at URL https://doi.org/10.1109/SFCS.1997.646099

Mathematics Subject Classification ID

Computer science (68-XX)

This page was built for publication: On the complexity of a set-union problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7251039)