Message:
[
First
|
Previous
Next
Last
]
By Topic:
By Author:
Font:
Proportional Font
LISTSERV Archives
ORNET Home
ORNET 2000
Subscribe or Unsubscribe
Log In
Get Password
Subject:
A new paper claiming P=NP
From:
Stas Busygin <[log in to unmask]>
Reply-To:
Date:
Sun, 08 Oct 2000 22:25:43 +0300
Content-Type:
text/plain
Parts/Attachments:
text/plain (24 lines)
Dear Fellows! A new paper has just been published in Stas Busygin's Repository for Hard Problems Solving. It is "An Efficient Algorithm for the Minimum Clique Partition Problem" by A. Plotnikov. Please find this proposal on efficient solving of an NP-hard problem at: http://www.busygin.dp.ua/clipat.html http://www.geocities.com/st_busygin/clipat.html (mirror) The publication policy of the repository may be found at: http://www.busygin.dp.ua/call.html http://www.geocities.com/st_busygin/call.html (mirror) Best regards, Stas Busygin email: [log in to unmask] WWW: http://www.busygin.dp.ua %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Top of Message | Previous Page | Permalink
Advanced Options
For help and support help@jisc.ac.uk