Natural Proofs
why the circuit lower-bound techniques that existed could not settle P vs NP
Read it
EnglishTiếng Việt (abstract only)中文 (abstract only)日本語 (abstract only)
English beside Tiếng ViệtEnglish beside 中文English beside 日本語
- 9 sections
- 0 figures
- 0 equations
- 40 references
- cited by 0 here
- difficulty 5 of 5
- the publisher's page
Contents
- 1Introduction
- 2Natural proofs
- 3Examples of naturalizing arguments
- 4Inherent limitations of natural proofs
- 5**One property of formal complexity measures**
- 6Conclusion
- 7Acknowledgements
Its place here
No other paper in this corpus cites it and it cites none of them.