{"version":"1.0","type":"link","title":"Non-constructive algorithm existence proofs - Newikis","description":"The vast majority of positive results about computational problems are constructive proofs, i.e., a computational problem is proved to be solvable by showing an algorithm that solves it; a computational problem is shown to be in P by showing an algorithm that solves it in time that is polynomial in…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}