{"version":"1.0","type":"link","title":"P versus NP problem - Newikis","description":"The P versus NP problem is a major unsolved problem in theoretical computer science. Informally, it asks whether every decision problem for which a proposed positive answer can be quickly verified can also be quickly solved.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}