Active Bibliography

1 NP and Mathematics - a computational complexity perspective – Avi Wigderson, Steve Smale
17 Transparent Proofs and Limits to Approximation – László Babai - 1994
17 An overview of computational complexity – Stephen A. Cook - 1983
Efficient Algorithms on Asteroidal Triple-Free and Distance Hereditary Graphs – Hari Balakrishnan - 1993
Mathematical Foundations of Modern Cryptography: Computational Complexity Perspective – Shafi Goldwasser - 2002
1 Cryptology – Prof Ronald Rivest, L. Rivest
127 Algorithms for the Satisfiability (SAT) Problem: A Survey – Jun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah - 1996
37 Network Flow Algorithms – Andrew V. Goldberg, Eva Tardos, Robert E. Tarjan
15 A Taxonomy of Proof Systems – Oded Goldreich - 1997
The Gödel Phenomena in Mathematics: A Modern View – Avi Wigderson
26 Efficient parallel algorithms for chordal graphs – Philip N. Klein
2 A survey of the algorithmic properties of simplicial, upper bound and middle graphs – Grant A. Cheston, Tjoen Seng Jap
5.1.1 Identical Processors – Problem Pwcjnax
17 Lecture Notes on Cryptography – Shafi Goldwasser, Mihir Bellare - 2001
Black Boxes, Incorporated – Mohammad Mahmoody, Avi Wigderson - 2012
3 Steiner Trees and Beyond: Approximation Algorithms for Network Design – Ramamurthy Ravi - 1993
17 Open Questions, Talk Abstracts, and Summary of Discussions – Joan Feigenbaum, Michael Merritt - 1991
5 A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP – Iftach Haitner, Mohammad Mahmoody, David Xiao - 2009
21 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995