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? 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? e.g. symmetric metric TSP using naive permutations is O(n!), whereas using using dynamic programming TSP it is O((n^2)(2^n)). -- ... 5 May 2010 10:25 If - this statement is used to open an exact proof p = np, if this is true or false, do this. 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 closes it. http://meami.org/ ... 4 May 2010 10:04 how to approach proofs? Does anyone have any good resources on how to approach proofs? Specifically proofs in Computation Theory (automata, regular expressions, Turing machines, etc.). ... 3 May 2010 09:49 How cool is this? Hi! Take an arbitrarily large two dimensional table and place pegs onto a finite number of its cells while observing the following rules: 1. Cell (0,0) contains a peg. 2. Cell (0,n) contains a peg if and only if Cell (n,0) contains a peg. 3. Cell (p,q) contains a peg if and only if both Cell (p,0) and Cell ... 3 May 2010 06:34 Symmetry and Abstraction The number symbol for a quantity of ten did not necessarily have to be expressed by two digits. This decision was made by us, so it may be a problem. I claim P equals NP equals equals zero when N equals ten. Here is my proof: Let P equal ZERO. Let N equal TEN. ZERO equals TEN multiplied by ZERO, proving ... 2 May 2010 12:02 A Feasible Optimal Solution to the P Versus NP Problem: l=7 On May 1, 1:58 pm, Superfly Current Events wrote:        min 3x+4y+2z        s.t. x+y+z=2        x,y,z E{0,1}      l=0            /\           /  \        x=0    x=1         /      \        /        \  min 4y+2z        min 3+4y+2z  s.t. y+z=2       s.t. y+z=1 ... 1 May 2010 17:36 A Feasible Optimal Solution to the P Versus NP Problem: min 3x+4y+2z s.t. x+y+z=2 x,y,z E{0,1} l=0 /\ / \ x=0 x=1 / \ / \ min 4y+2z min 3+4y+2z s.t. y+z=2 s.t. y+z=1 x,y,z E{0,1) l=0 x,y,z E{0,1} l=3 /\ / y=0 y=1 / / \ / NON-FE... 1 May 2010 17:36 Partial correctness and Total correctness Dear All, We know what is Partial correctness and Total correctness for sequential programs. What is Partial correctness in case of concurrent programming? And what is total correctness in this case? Srinivas ... 4 May 2010 08:58 Subject: finding the $n$-th largest $d$-fold products Hi all. Let $\lambda_1\ge\lambda_2\ge\dots>0$. Let $d$ be a positive integer. For a multi-index $\alpha=[\alpha_1,\dots,\alpha_d]$ of positive integers, let $$\lambda_\alpha = \prod_{j=1}^d \lambda_{\alpha_j}.$$ Now suppose that $\lambda_{\alpha}^{(n)}$ is the $n$th-largest element in the set \$\{\lambda_\alph... 29 Apr 2010 10:06 -n (1 + n) + (1 + n) (2 + n) in: http://:{(n + 1 )*(n + 2)} - {n (n + 1)} out:: .{-n (1 + n) + (1 + n) (2 + n)} In[1]:= 1*2 Out[1]= 2 In[2]:= 2*3 Out[2]= 6 In[3]:= 6 - 2 In[4]:= 4 - 1 In[5]:= FactorInteger[3] Out[5]= {{3, 1}} In[6]:= 2*3 Out[6]= 6 In[7]:= 3*4 Out[7]= 12 In[8]:= 12 - 6 In[9]:= 6 - 1 Ou... 24 Apr 2010 22:43