Raul wrote:
> Let's say we've got a relatively small expression, with only 50
> variables. And, let's say we express that in terms of SAT-3, with
So, are you afraid that an actual market could solve the example that the
author was entertaining and one would have to go to 50 variables? Why are
> Maymin failed in his effort to place a specific NP-complete problem 3SAT
in P by not constructing polynomial-time algorithm. What does that prove?
>
I am afraid, not much regarding P =? NP, since as you noted earlier,
his "Programming
the Market" scheme is a Market Machine in the sense of a
