radekh's articles:

Items(13) /2 Next >> Last >|

Extended counter-example for extended M.Diaby Linear Model 27 28 (5/30/2008 10:48:10 AM) comp.theory Hi all, After long time there it is: http://arxiv.org/abs/0805.4718 (Arxiv said: Abstract will appear in mailing scheduled to begin at 20:00 Sunday US Eastern time (i.e., Mon 2 Jun 08 00:00:00 GMT). If you wi... Rados

Diaby's TSP formulation - The Come Back 30 29 (6/4/2007 12:13:28 PM) comp.theory Mr. Diaby, We have noticed that your article has been published in WSEAS Transactions on Mathematics. For those who are interested: http://arxiv.org/ftp/cs/papers/0609/0609005.pdf I am glad that you ... Rados

New thred of discussion about Mr. Diaby's algorithm 2 20 (11/27/2006 12:24:31 PM) comp.theory Hi, My usenet client is fed up with depth of discussion about Mr. Diaby TSP conjecture so I have decided to summarize it here and ask all of you to continue discussion here. We are discussing paper http... Rados

Discussion about transformation TSP to UniqueTSP 76 19 (11/27/2006 12:07:30 PM) comp.theory Hi, My usenet client is fed up with depth of discussion about Mr. Diaby TSP conjecture where algorithm converting TSP to UniqueTSP appeared. Idea was simple - we shift all weights by large number and add s... Rados

Automated theorem proving 3 25 (11/14/2006 7:26:12 AM) comp.theory Hi, I'm starting to learn more about Automated theorem proving and would like to ask those who have expirience using it: I would like to make automated proof for (let's say) DeMorgan's law for sets but not ... Rados

Another LP model for TSP (by S. Gubin) 26 30 (11/14/2006 6:52:06 AM) comp.theory Hi, I paste next discussion about different model. After mails few weeks ago paper was revised and now we have second version. My objections to previous were mainly concerning about equations for Gauss-Jorda... Rados

Help request #2 1 24 (11/14/2006 6:45:04 AM) comp.theory Dear all, Yesterday I read (by chance) on some page that "Hofman argument In exceptionally broken English..." Well, I can only agree :-))) - my English is far from being "easy to read". I regret it, but at... Rados

LP usage for NP-complete problem (TSP) 0 23 (11/9/2006 6:20:20 PM) comp.theory Dear Group Members, I start discussion about Mr. Diabys algorithm claimed to be polynomial time solver for any TSP (known to be NP-complete) problem. Article can be found on http://arxiv.org/abs/cs.CC/0609005 ... Radoslaw

Analog proof that P=NP - any comments? 2 26 (11/7/2006 2:16:48 PM) comp.theory Hi all, I have read of http://arxiv.org/abs/cs/0406056 - this paper uses analog process to prove that P=NP. I have tried to find basis for this in http://sapiens-ei.eng.hokudai.ac.jp/contents/downloads/pape... Rados

Discussion regarding Mr. Diabys algorithm 64 58 (11/4/2006 9:08:45 AM) comp.theory Hi all, Below is discussion I find very interesing, and I think should be publicated (author of discussion didn't know how to start thread in USENET). Answer and discussion will be send as reply. >>>>>>>>>>>... Radoslaw

radekh's replies:

Items(37) /4 Next >> Last >|

Should I study C++ . Is it too late. I am 37 Now 8 28 (5/30/2007 6:53:36 PM) comp.theory Please advise Katie Tam Network Administrator http://www.linkwaves.com/main.asp http://www.linkwaves.com/ ... katietam (12)

Diaby's TSP formulation - The Come Back 30 29 (6/4/2007 12:13:28 PM) comp.theory Mr. Diaby, We have noticed that your article has been published in WSEAS Transactions on Mathematics. For those who are interested: http://arxiv.org/ftp/cs/papers/0609/0609005.pdf I am glad that you ... radekh (231)

Program control-flow graph modeling 3 31 (6/11/2007 2:56:49 PM) comp.theory Hi, I'm looking for an appropriate way to represent the control flow graph of programs. Let's say I've this easy C program: void foo3(void) { int a = 0; return; } void foo2(void) { foo3(); foo5(); ... plfriko (499)

My MPS generator for the TSP 6 18 (7/8/2007 4:41:28 AM) comp.theory F.Y.I.: My MPS file generator has been slightly improved: minor cosmetics + information about the longest TSP tour (obtainable from my LP model by applying a cost-maximization LP routine to it) printed with th... moustapha.diaby (187)

The Hamiltonian Cycle Problem is Polynomially Solvable 33 32 (7/10/2007 2:36:05 AM) comp.theory Dear Computer Scientists, and Mathematicians, I have written a paper that the Hamiltonian Cycle Problem (known to be NP-Complete) is polynomially solvable. Please read my paper on http://arxiv.org/abs/0707.11... deepakc (240)

Some Theorems on a Set of Functions with Irrational Periods 5 19 (8/4/2007 3:28:32 PM) comp.theory Dear All, I have written a paper, containing Theorems, which I hope will find use in the P?=NP Question. I look forward to your comments on my paper, which is accessible at http://arxiv.org/abs/0707.1176 Tha... deepakc (240)

Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial 22 37 (12/26/2007 3:40:39 AM) comp.theory Determining a Hamiltonian cycle in 2-connected bipartite cubic graph had been claimed as a NP-completed problem by Akiyama etc. Now we show that this problem is in polynomial, thus this is the second case ... ccghzhu (55)

Questions about Parity SAT 8 29 (1/16/2008 1:46:28 PM) comp.theory Hi everyone, I've constructed a way to reduce Parity SAT (that is, the question whether a SAT instance has an odd number of satisfying assignments; a complete problem for Parity P if I'm not mistaken) to its s... a_plakhoff (2)

Imaginary Polynomial Time Algorithm for Subset sum Problem 18 25 (3/4/2008 2:15:42 AM) comp.theory Imaginary Polynomial Time Algorithm for Subset sum Problem This is a very abstract algorithm requiring a lot of imagination. It starts with an imaginary piece of infinitely large paper and an infinitely preci... HorkGames (4)

Extended counter-example for extended M.Diaby Linear Model 27 28 (5/30/2008 10:48:10 AM) comp.theory Hi all, After long time there it is: http://arxiv.org/abs/0805.4718 (Arxiv said: Abstract will appear in mailing scheduled to begin at 20:00 Sunday US Eastern time (i.e., Mon 2 Jun 08 00:00:00 GMT). If you wi... radekh (231)