On random hard sets for NP

DOI10.1006/INCO.1996.0022MaRDI QIDQ1917082zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

oraclerandom hard set

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 1555920
• scientific article; zbMATH DE number 4049050
• Correlation of NP-sets and co-NP-sets with respect to a random oracle

Cited in

(7)

• scientific article; zbMATH DE number 4049050 (Why is no real title available?)
• Random CNF's are hard for the polynomial calculus
• Computational Randomness from Generalized Hardcore Sets
• Correlation of NP-sets and co-NP-sets with respect to a random oracle
• Unimodality, independence lead to NP-hardness of interval probability problems
• scientific article; zbMATH DE number 1555920 (Why is no real title available?)
• Some Observations about the Randomness of Hard Problems

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)