Re:The polynomial algorithm for 3-SAT problem (or P=NP)
by mzl on Thursday January 20, 2011 @03:21AM
(#2123069)
OTOH, simplex is very efficient already. Average-case complexity for random matrices is polynomial, and there are some interesting results that extend beyond that (see http://arxiv.org/abs/cs/0111050).
[ Parent
| on HN ]
There are no comments on this comment yet.