... [···] Of course. But I believe it's important to point out, because people often get a false impression from the hype, that from what is currently known...
1647
Jeffrey Considine
jconsidi@...
Nov 1, 2000 1:50 pm
Eric, a while back you said ... Does the same hold for finding colorings of perfect graphs? (with the same qualifications as your original statement :) jef...
1648
Anatoly D. Plotnikov
aplot@...
Nov 1, 2000 7:27 pm
Hello everybody, I would like to inform that I have made the new corrections in the paper. Eric Cordian offered a digraph that had shown a unforeseen Case....
1649
vznuri@...
Nov 1, 2000 7:27 pm
NM ... I agree- the hype on quantum computing has already gotten way out of hand in some ways, even in typically reserved academic community. maybe I can...
1650
Duraid Madina
duraid@...
Nov 1, 2000 8:25 pm
This is my first post to the list, I guess I should throw my $0.02 in since I'm "in the field." ... It's interesting to note that this is true almost...
1651
vznuri@...
Nov 2, 2000 12:50 am
hi DM!! nice post. you say you are in the field of QM, maybe you would like to introduce yourself & some of the things you're working on, I'm sure everyone ...
1652
vznuri@...
Nov 2, 2000 1:00 am
a little note on the beauty of proof. consider one of hardy's favorite examples, that of the infinitude of prime numbers. now, primes are very mysterious and...
1653
vznuri@...
Nov 2, 2000 1:57 am
according to this article, a recent experimental breakthrough in quantum mechanical research by Kwiat at Los Alamos laboratories, "demonstrating the existence...
1654
vznuri@...
Nov 2, 2000 2:09 am
a really nice article by gareth cook on the minesweeper problem and its link to the clay math problems ...
1655
Eric Cordian
enoch@...
Nov 2, 2000 3:16 am
... From the article... "Proving the [NP=P] conjecture false would mean that modern encryption technology, the foundation of electronic commerce, would be open...
1656
Kyle Markley
kmarkley@...
Nov 2, 2000 7:51 am
Hello again, everybody. I've been too busy to followup on the maximum clique messages until now, but I'm happy to report that I've made considerable progress...
1657
vznuri@...
Nov 2, 2000 8:05 pm
a question for EL, martin, and anyone else familiar with the perfect graph conjecture. as I understand it, it is the conjecture that all perfect graphs have no...
1658
Tom Morrisette
eiffelpgmr@...
Nov 4, 2000 4:47 pm
... Kyle, I don't see any reason to be uncomfortable with using an approximation algorithm. It sounds like you are using a branch and bound strategy to prune...
1659
vznuri@...
Nov 4, 2000 10:46 pm
re: approximation vs. exact algorithms (KM/TM) KM, I understand what you are saying but I think you may be using the term "approximation algorithm" in a way...
1660
Stas Busygin
busygin@...
Nov 5, 2000 7:27 pm
Hello All! The review of Stas Busygin's Repository for Hard Problems Solving on the paper "An Efficient Algorithm for the Minimum Clique Partition Problem" by...
1661
Stas Busygin
busygin@...
Nov 5, 2000 7:46 pm
... Its main hub is that any graph without an odd hole or antihole is perfect. The inverse is obvious as I understand. ... Maybe, but IMHO to solve those...
1662
Eric Cordian
enoch@...
Nov 6, 2000 7:18 am
Stas Busygin writes: . ... . Ok. These are problems we have discussed on the list before. . "Considering" can get lost by removing an essential arc of the...
1663
Marx Dániel
dmarx@...
Nov 6, 2000 7:25 am
... The usual example is the Grötzsch graph which is triangle-free and cannot be colored with 3 colors. It has 11 vertices and the following edges: (1,2)...
1664
Anatoly D. Plotnikov
aplot@...
Nov 6, 2000 6:37 pm
Hello everybody, I have read the Stas' review and would like to give the several comments about discussion and the review. I wrote earlier, I have a big profit...
1665
vznuri@...
Nov 6, 2000 8:08 pm
hi all, EC/SB/AP a paper sets out to accomplish something and accomplishes it. here are is what we in CS would like to accomplish roughly in order of...
1666
Stas Busygin
busygin@...
Nov 6, 2000 9:52 pm
Hello, Anatoly and All! ... Perhaps you mean "another instance", not problem. Well, I pointed that your MPP-problem has an amazing property giving a chance to ...
1667
Stas Busygin
busygin@...
Nov 6, 2000 9:58 pm
... With a correct co-vertex introduction it halts in ptime always. But still we don't have a reasonable arc "consideration" procedure giving always a good...
1668
Anatoly D. Plotnikov
aplot@...
Nov 7, 2000 7:13 am
Hello everybody, I think that our discussion about the paper, at last, is become more important. I am meaning a methodology for solving the problem. I believe ...
1669
Anatoly D. Plotnikov
aplot@...
Nov 7, 2000 8:14 am
... Of course, "another instance". ... Yes, we may use the similar analogy. However, this is an analogy only. ... This is not exact. If we want to be short,...
1670
Stas Busygin
busygin@...
Nov 7, 2000 5:31 pm
Hello Anatoly! Then I have the only question (since the rest is empty). ... WHY do you believe that the number of "Cases" will be finite??? The matter is that...
1671
vznuri@...
Nov 7, 2000 7:22 pm
a paper can create a kind of momentum. sometimes this momentum builds slowly or rapidly, depending on a paper. if a paper is very difficult to understand but...
1672
Dan Pehoushek
danpehous@...
Nov 7, 2000 9:29 pm
Good point about correctness. The nice thing, with positive satisfiability, is that youcan plug in any found assignment to check it. This I do. Also, it...
1673
Eric Cordian
enoch@...
Nov 7, 2000 9:47 pm
Anatoly D. Plotnikov writes: . ... . ... . If the leading arc of the marked vertex of lowest rank is an essential arc of the MCP, and removing it does not...
1674
Anatoly D. Plotnikov
aplot@...
Nov 8, 2000 4:28 am
Hello everybody, ... This is not seriously. The answer is simple: we have a finite number of parameters, characterizing an MPP and marked vertex in it. Anatply...
1675
Stas Busygin
busygin@...
Nov 8, 2000 11:18 am
Hello, Anatoly and All! ... Sorry, I don't understand which "parameters" are there? I only may say that the number of possible structures below a marked vertex...
