P = NP? Not exactly, but here are some research questions from the Office of Technology. | Federal Trade Commission
The .gov means it’s official. Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site. The site is secure. The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely. We enforce federal competition and consumer protection laws that prevent anticompetitive, deceptive, and unfair business practices. View Enforcement Find legal resources and guidance to understand your business responsibilities and comply with the law. Browse legal resources View all Competition Matters Blog posts We work to advance government policies that protect consumers and promote competition. View Policy Find legal resources and guidance to understand your business responsibilities and comply with the law. Browse legal resources Memo from Chair Lina M. Khan to commissi
The scientific community has a history of creating and sharing lists of important or interesting questions. The mathematician Paul Erdős, for example, famously doled out his questions to students and colleagues, some of which are unsolved to this day.[1] The Clay Mathematics Institute has its list of seven Millenium Problems,[2] six of which remain unsolved. Among these is the P = NP problem,[3] a fundamental question in computational complexity theory and obviously the Office of Technology’s favorite of the seven. Just as the scientific frontier “is still open and abounds in important…
related reading
- Shtetl-Optimizedscottaaronson.blog
- P versus NP problem - Wikipediaen.wikipedia.org
- pnp.pdfscottaaronson.com
- Computational Complexityblog.computationalcomplexity.org
- P vs. NP for Dummiesscottaaronson.blog
- Reasons to believescottaaronson.blog
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- NP-completeness - Wikipediaen.wikipedia.org
- P vs NP and its application to zero knowledge proofs | RareSkillsrareskills.io
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- Complexity class - Wikipediaen.wikipedia.org
- Impagliazzo's Five Worldsblog.computationalcomplexity.org