On random hard sets for NP
From MaRDI portal
Publication:1917082
DOI10.1006/INCO.1996.0022zbMATH Open0853.68095OpenAlexW1976403440MaRDI QIDQ1917082
Ronald V. Book, Osamu Watanabe
Publication date: 2 January 1997
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1996.0022
Related Items (3)
Unimodality, independence lead to NP-hardness of interval probability problems ⋮ Random CNF's are hard for the polynomial calculus ⋮ Computational Randomness from Generalized Hardcore Sets
This page was built for publication: On random hard sets for NP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917082)
