Could P = NP be true? Most people seem to think that P = NP is almost certainly false. I was wondering about a possible scenario where P = NP might be true. Generally speaking, it seems that in order to prove that a decision problem belongs to a certain complexity class, one has to find an algorithm to solve it. For example, I wou... 19 Dec 2009 20:21 Symposium “Image Processing and Analysis” within the ICCES'10 USA - Announce & Call for Contributions ***************************************************************************************************************** Symposium Image Processing and Analysis International Conference on Computational & Experimental Engineering and Sciences 2010 (ICCES'10) Mar 28-Apr 1, 2010, Las Vegas, USA http://www.icces.org/ ... 9 Dec 2009 15:31 Implementation suggestions for creating a Hierarchical circuit database nick writes: I am writing a personal software that will read circuit design/ netlist. I will be using the MCNC benchmarks that contain different types of designs in SPICE netlist format. [snip] You cross-posted this question to comp.theory, comp.lang.c++, comp.lang.c, comp.lang.pyth... 9 Dec 2009 14:25 Implementation suggestions for creating a Hierarchical circuit database Hi, I am writing a personal software that will read circuit design/ netlist. I will be using the MCNC benchmarks that contain different types of designs in SPICE netlist format. I need some pointers/papers/suggestions on creating a "hierarchical" netlist database. The netlist database can, at times, be fully ... 10 Dec 2009 13:25 P Versus NP Resolutions Abounding? == Musatov's lemma == Musatov's lemma is named after the one-to-one function: Let a = 1 Let b = 2 Let e = 5 Let j = 10 Let s = 19 Let u = 21 Then: j * a/b = e e * s = 95 u * 95 = 1,995 s/abej * 1,995 = 361 One of Ramanujan's approximations of was (9^2 + (19^2/22))^1/4. 361 is a prime square (19^... 9 Dec 2009 23:17 A great site for algorithm and programming solutions Hey Everyone, I recently found a website www.geeksforgeeks.org for good solutions of commonly asked c programming and algorithm questions. I just thought of sharing with you people. Hope you will find it useful.... Regards, Dheeru ... 11 Dec 2009 12:28 most common algorithms and design patterns ... Hi ~ I took the time to search around for such a thing as a survey or list of the most common algorithms and design patterns ever used, yet the closest I could get to the answer to my question were CS curricula ~ Do you know from where could I get such a survey? ~ Thank you lbrtchx {comp.theory, sci.op-... 2 Dec 2009 02:09 Simple question about a tape and a few strings. Hello folks, I would really appreciate if some one could help me on the following problem. Given n strings S_1 through S_n, where each S_k is simply a concatenation a of letter, say "a", but of arbitrary yet finite length. For example, S_1=aa , S_2=a , S_3=aa , S_4=aaa. Consider a tape of length T. We start... 9 Dec 2009 15:31 Question on queuing theory I have seen the formula R = S/(1-U) where R is response time, S is service time, and U is resource utilization. One thing troubles me, and that is how resource utilization is defined? Let's say that I have a server request exactly every 1/10th of a second. Let's further suppose that S is 1/10th of a second als... 2 Dec 2009 18:57 JSH: Authority from Google search results? JSH wrote: Consider 2+2 = 4. OPINION can be that 2+2 = 5. In your case, that is tantamount to fact. Human beings can think the damndest things. Indeed. You think your SWJPAM paper is correct. Google search results would tend toward 2+2=4 is the hypothesis, even if people generally believe t... 14 Dec 2009 17:42