Hi Klaus! ... The hardest, smallest, random instances that I know of are called 5-5 regular. For an n variable instance, place 5 positive and 5 negative...
1302
Vladimir Z. Nuri
vznuri@...
Aug 24, 2000 2:24 am
hi gary.. re: your idea of coming up with a fitness function to help find factoring via genetic algorithms. it sounds like a good approach that you picked. do...
1303
Anukool Lakhina
anukool@...
Aug 24, 2000 9:21 pm
... please please do! (or if you don't want to, please share them with me. I'd love to learn more about this. :)) Thanks! anukool...
1304
Vladimir Z. Nuri
vznuri@...
Aug 25, 2000 8:01 am
hi anukool. ask and you will receive. actually I was just testing whether anyone on the list is awake, haha. ok, here is an interesting genetic algorithm...
1305
Klaus D. Witzel
kwitzel@...
Aug 25, 2000 8:47 am
Vlad, I'm here and awake (but sometimes need some polynominal time for my brain to think about what was written in postings :-) On Thursday, August 24, 2000...
1306
Martin Baker
martinb@...
Aug 25, 2000 10:23 am
... You've added an interesting twist to GA. I think the main disadvantage is that the variable counts are not "responsive"; they count the entire history of...
1307
Gary Shannon
reboot@...
Aug 25, 2000 6:44 pm
... From: "Vladimir Z. Nuri" <vznuri@...> To: <theory-edge@egroups.com> Cc: <vznuri@...> Sent: Wednesday, August 23, 2000 7:25 PM ...
1308
Vladimir Z. Nuri
vznuri@...
Aug 26, 2000 12:17 am
... your call, but it seems significant to me, if there was a lot of flexibility possible in the algorithm, and it evolved to pollard's rho method anyway. also...
1309
Vladimir Z. Nuri
vznuri@...
Aug 26, 2000 12:27 am
... ah, I'm relieved that at least one person has not seen it before =) I think the main disadvantage is ... I agree, they have inertia so to speak the longer...
1310
Vladimir Z. Nuri
vznuri@...
Aug 26, 2000 1:05 am
I thought I would just take a minute to talk about the host of these mailing lists, egroups. this company was started a few years ago to host mailing lists,...
1311
Martin Baker
martinb@...
Aug 26, 2000 3:17 am
... I looked around on the web for this but could not find it. There was an article some months ago, in Scientific American I believe, about someone doing GA...
1312
theory-edge@egroups.com
Aug 26, 2000 8:54 pm
Enter your vote today! Check out the new poll for the theory-edge group: In your own subjective opinion, what is relation between classes P and NP? o P==NP o...
1313
Stas Busygin
busygin@...
Aug 26, 2000 9:22 pm
Hi, Vladimir and All! Yes, egroups is a pearl of the net. I'd like to supplement your review and point to additional opportunities for members. ... Yes, they...
1314
Michiro Nasu
nasukun@...
Aug 28, 2000 12:56 am
Hi Stas! you wrote in Sent: Monday, August 28, 2000 8:03 AM, ... Cook showed that any NP-problem is reducible to SAT in polynomial time O(P(n)^3) with some...
1315
Vladimir Z. Nuri
vznuri@...
Aug 28, 2000 3:10 am
... I think I may have read about exactly the same thing in Discover. although it was such a breakthrough that it was probably reported in many venues. the...
1316
Michiro Nasu
nasukun@...
Aug 28, 2000 2:48 pm
Dear Vlad and all, We take pleasure in announcing that we released the new version Ariadne, hamiltonian experiment program, rev1.3k formally. Ariadne runs in...
1317
Stas Busygin
busygin@...
Aug 28, 2000 8:22 pm
Hi Michiro! ... I mean size, not time. But I think it's quite possible for time to be always not more than quadratic there too. ... SAT01 is in NP because its...
1318
Stas Busygin
busygin@...
Aug 28, 2000 8:22 pm
... Thanx for the support of my undertaking! I think we'll discuss results later, when there will be more votes. Now I ask everyone interested in P?=NP who has...
1319
Michiro Nasu
nasukun@...
Aug 28, 2000 9:38 pm
Hi Stas! ... maybe you know it. but i don't know. ... certainly there broadly is believed such a definition for NP-Completeness but in my opinion it is quite...
1320
Stas Busygin
busygin@...
Aug 28, 2000 10:07 pm
... No, this definition is correct. The verification of a certificate has no relation to the existance of a solution (i.e., positivity/negativity in your...
1321
Michiro Nasu
nasukun@...
Aug 29, 2000 4:33 am
Hi Stas! ... Ahhhh!!!! as well, i should rather vote for the "The classes are defined incorrectly". here is a two answer "yes" and "no" both of which were...
1322
Stas Busygin
busygin@...
Aug 29, 2000 9:29 pm
... Please comprehend, nobody ask you to verify a SOLUTION. You must verify a CERTIFICATE. Is it clear? If not, here is my last attempt to explain this for you...
1323
Michiro Nasu
nasukun@...
Aug 30, 2000 1:29 am
Hi Stas! you wrote, Please comprehend, nobody ask you to verify a SOLUTION. You must verify a CERTIFICATE. Is it clear? If not, here is my last attempt to...
1324
Vladimir Z. Nuri
vznuri@...
Aug 31, 2000 6:18 am
here's an interesting article that gives a further glimpse of the flexibility of genetic algorithms. very promising indeed. researchers at Brandeis university...
1325
Michiro Nasu
nasukun@...
Aug 31, 2000 9:33 am
Hi Vlad! you wrote, ... thank you. Michiro...
1326
joeseph11@...
Aug 31, 2000 4:04 pm
Question: Are there any known oracles X and Y for which NP[X]=co-NP[X] and NP[Y]=/= co-NP[Y] ? Joe....
1327
Jeffrey Considine
jconsidi@...
Aug 31, 2000 7:31 pm
... Yes. I don't know what they are, but this result is cited as a reason why oracle based reasoning won't solve the P?=NP question. You could probably find ...
1328
Anatoly D. Plotnikov
aplot@...
Sep 1, 2000 11:38 am
Hello everyone, One of largest spesialists in Graph Theory of the former USSR have written to me recently (in my translation): Now, it is accepted to include...
1329
Klaus D. Witzel
kwitzel@...
Sep 1, 2000 2:29 pm
Anatoly, you can find, with regards to Minimum Graph Coloring, the statement "This problem is known to be NP-hard [9], " @ ...
1330
Michiro Nasu
nasukun@...
Sep 1, 2000 5:52 pm
Hi Stas and all! I wrote in my mail Sent: Wednesday, August 30, 2000 10:27 AM, ... Well, Let's begin. Here are 2 definitions of SAT01 problem. I received them...
