On 2/12/2017 10:50 PM, Michał Kłeczek wrote:
Sorry, NP Completness of what? I have been the first to mention NP hardness of constraint satisfaction problem but I am not sure if this is what you are asking about.Thanks, Michal Patricia Shanahan wrote:Are you literally claiming NP Completeness, or just using that as an analogy for really, really difficult?