• Login
    View Item 
    •   NWU-IR Home
    • Inaugural Lectures
    • Inaugural Lectures - Mafikeng Campus
    • View Item
    •   NWU-IR Home
    • Inaugural Lectures
    • Inaugural Lectures - Mafikeng Campus
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

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

    Thumbnail
    View/Open
    Munapo_E.pdf (404.7Kb)
    Date
    2019
    Author
    Munapo, Elias
    Metadata
    Show full item record
    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
    URI
    http://hdl.handle.net/10394/32738
    Collections
    • Inaugural Lectures - Mafikeng Campus [34]

    Copyright © North-West University
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of NWU-IR Communities & CollectionsBy Issue DateAuthorsTitlesSubjectsAdvisor/SupervisorThesis TypeThis CollectionBy Issue DateAuthorsTitlesSubjectsAdvisor/SupervisorThesis Type

    My Account

    LoginRegister

    Copyright © North-West University
    Contact Us | Send Feedback
    Theme by 
    Atmire NV