First Page | Document Content | |
---|---|---|
![]() Date: 2010-03-21 22:20:21Cryptography Computational complexity theory Complexity classes Interactive proof system Zero-knowledge proof NP Probabilistically checkable proof IP Soundness Commitment scheme NEXPTIME P versus NP problem | Add to Reading List |