On random hard sets for NP

DOI10.1006/INCO.1996.0022zbMATH Open0853.68095OpenAlexW1976403440MaRDI QIDQ1917082FDOQ1917082

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

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

zbMATH Keywords

oraclerandom hard set

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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)