NP-Completeness Software with efficient algorithm designing for hard computational problems. It includes a new NP-complete problem named SAT01, which is suitable for reduction to it and for solving algorithms development. Also I have designed an almost exact polynomial algorithm for maximum-weight clique problem which was implemented in QUALEX solver.

Current Version:   QUALEX 1.1, SAT01 3.1.2 License Type:   ??

Home Site: http://www.busygin.dp.ua/npc.html Source Code Availability: Yes Available Binary Packages: Debian Package: No RedHat RPM Package: No Other Packages: Some Yes Targeted Platforms: Linux, Win32 Software/Hardware Requirements: None

Other Links: None Mailing Lists/USENET News Groups: None User Comments: None See A Screen Shot? (Not Yet)

  SAL Home   |   Numerical Analysis   |   Optimization