{"version":"1.0","type":"link","title":"Promise problem - Newikis","description":"In computational complexity theory, a promise problem is a generalization of a decision problem where the input is promised to belong to a particular subset of all possible inputs. Unlike decision problems, the yes instances (the inputs for which an algorithm must return yes) and no instances do…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}