If - this statement is used to open an exact proof p = np, if this is true or false, do this.
in [Theory]
|
Prev: how to approach proofs?
Next: Could another characterization of NP-hard problems be that their naive algorithmic solution (e.g. permutations) is factorial; whereas, a dynamic programming algorithm is exponential?
From: H.Y. ADDANDSTUFF on 4 May 2010 06:31 If - this statement is used to open an exact proof p = np, if this is true or false, do this. = is equals, != equals not { is open function, } is close function //comments here and more there <!---// starts the script, //---> closes it. http://meami.org/
From: mister1729 on 4 May 2010 09:27
FFFFFFFFUUUUUUUUUUUU King Idiot. "H.Y. ADDANDSTUFF" <marty.musatov(a)gmail.com> wrote in message news:82a90105-26c2-4766-87a2-4c7dae837201(a)g5g2000pre.googlegroups.com... > If - this statement is used to open an exact proof p = np, if this is > true or false, do this. > = is equals, != equals not > { is open function, } is close function > //comments here and more there > <!---// starts the script, //---> closes it. > http://meami.org/ |