I posted a paper on the arxiv.org site which claims that p!=np on May 20. I got a lackluster response to it which was partially my fault, since I didn't write...
... May ... fault, ... understand. ... please ... that I ... even ... true. ... not ... process. ... I read your paper and your proof needs just a bit more...
Dear too_bad_u_wrong I believe I considered this case in the proof. I clearly noted that the number of possible inputs is large enough so that no look-up- ...
... that ... I didn't say lookup table (although that will be another area to fix later). I said "naively assigns," i.e. GENERATES, a (probably incorrect but...
I appreciate your feedback. I don't understand the nature of the algorithm that you are describing and would like to understand it. Could you please descibe...
hi all, I went to see the new pixar movie "finding nemo" last nite. a real kids flick but plenty of entertaining stuff for adults. what interests me is the ...
... it. ... Your "proof" does not prove this algorithm doesn't always work: // inputs: (globals) // int n - size of SUBSET-SUM instance // int a[] - SUBSET-SUM...
cafeinst: What you are missing in your proof is completeness. If you want to prove a problem is not solvable in polynomial time then it must be shown that...
... wrote: By the way this conversation is going, it seems that if I were to state that 2+2=4, then you all would probably not believe me or you would ask me...
Let me respond anyway to your comments. I proved that an n-optimal algorithm must take exponential time. Then by definition of an n- optimal algorithm, any...
This is not exactly my speciality, but it seems to me that you could have proven that if SUBSET-SUM is in Co-NP, then Co-NP != P. Question: is SUBSET-SUM in...
hi all, I was looking into IE browser javascript functionality & was knocked out at how much programming capability it has now. it seems mainly to come from...
... optimal ... Yes, you are correct that your terminology also needs corrections. First you provide a property of an n-optimal algorithm; "worst-case ...
This is just a summary of some discussions I've been having on other groups. The first question that arose was whether NP-complete implied 'requires...
c> Let me respond anyway to your comments. I proved that an n-optimal c> algorithm must take exponential time. Then by definition of an n- c> optimal...
Mikhael, Thank you for reading my short paper. Any more feedback is welcome but unfortunately I don't have much time for more comments as I'm also proving the...
hi mike, Im a little weak on the topics you are covering, but I think you didnt quite make it clear that when you say NP != E, the proof is that NP < E where...
c> I proved that all algorithms which fit this definition must have a c> certain property and that property has a weakness. Taking the gcd as c> you suggested...
i am BS(Comp Science) student and interesting in games based on real AI. i have already finished some under Turbo C. i have started work in Visual C++.NET . i...
Hi Imran, The best place to start with C++ (of any flavour) is 3ed (not the 2nd ed since the index was screwed in that version) of The C++ Programming ...
... From: Patrick Meuser To: theory-edge@yahoogroups.com Sent: Tuesday, June 03, 2003 12:45 AM Subject: Re: [theory-edge] Closing in on NP and 'reasonable'...
... From: vznuri To: theory-edge@yahoogroups.com Sent: Tuesday, June 03, 2003 9:40 AM Subject: [theory-edge] Re: Closing in on NP and 'reasonable' encodings hi...
... From: vznuri To: theory-edge@yahoogroups.com Sent: Tuesday, June 03, 2003 9:40 AM Subject: [theory-edge] Re: Closing in on NP and 'reasonable' encodings hi...
