Truth vs. Proof in Computational Complexity Boaz Barak∗ September 24, 2012 Theoretical Computer Science is blessed (or cursed?) with many open problems. For some of these questions, such as the P vs N P problem, it see

First Page		Document Content
Date: 2012-09-24 16:01:00		Truth vs. Proof in Computational Complexity Boaz Barak∗ September 24, 2012 Theoretical Computer Science is blessed (or cursed?) with many open problems. For some of these questions, such as the P vs N P problem, it see Add to Reading List Source URL: www.boazbarak.org Download Document from Source Website File Size: 326,07 KB Share Document on Facebook