NWU Institutional Repository

The Controversial Millennium Problem – Proof that NP=P / Elias Munapo

Loading...
Thumbnail Image

Date

Authors

Munapo, Elias

Journal Title

Journal ISSN

Volume Title

Publisher

North-West University (South Africa). Mahikeng Campus

Abstract

The general binary linear programming (BLP) problem is known to be NP Complete. The lecture presents a new approach of transforming any BLP into a convex quadratic programming (CQP) problem. It is known that the CQPs can be solved by interior point algorithms in polynomial time (P). This implies that NP=P and settles one of the controversial millennium open problems

Description

Citation

Endorsement

Review

Supplemented By

Referenced By