Truth vs. proof in computational complexity

MaRDI QIDQ4584894zbMATH OpenFDO

Authors Boaz Barak

Publication date 4 September 2018

Full work available at URL http://eatcs.org/beatcs/index.php/beatcs/article/view/53/49

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On Khot’s unique games conjecture
• Some estimated likelihoods for computational complexity
• Complexity classes as mathematical axioms
• \({\mathcal P}\), \({\mathcal{NP}}\) and mathematics -- a computational complexity perspective
• \(\mathrm P \overset {?} {=} \mathrm{NP}\)

Cited in

(3)

• Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis
• Some estimated likelihoods for computational complexity
• scientific article; zbMATH DE number 18853 (Why is no real title available?)

This page was built for publication: Truth vs. proof in computational complexity

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