10 Oct 2000 harrisj   » (Master)

Saw on Slashdot that somebody has allegedly posted a P- solution to an NP-complete problem (clique partitioning). If it really works out (I'm rather skeptical), it would also prove that P=NP. Pretty fascinating stuff regardless. Interested people can check it out at this link.

Latest blog entries     Older blog entries

New Advogato Features

New HTML Parser: The long-awaited libxml2 based HTML parser code is live. It needs further work but already handles most markup better than the original parser.

Keep up with the latest Advogato features by reading the Advogato status blog.

If you're a C programmer with some spare time, take a look at the mod_virgule project page and help us with one of the tasks on the ToDo list!