Structure vs combinatorics in computational complexity

MaRDI QIDQ4967162zbMATH OpenFDO

Authors Boaz Barak

Publication date 3 July 2019

Full work available at URL http://bulletin.eatcs.org/index.php/beatcs/article/view/237/228

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 2133317
• Random instances of problems in NP -- algorithms and statistical physics
• scientific article; zbMATH DE number 1072538
• scientific article; zbMATH DE number 863498
• scientific article; zbMATH DE number 90342

Cited in

(2)

• The Complexity of Public-Key Cryptography
• Structure versus hardness through the obfuscation lens

This page was built for publication: Structure vs combinatorics in computational complexity

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