First Page | Document Content | |
---|---|---|
Date: 2009-05-25 23:54:59Complexity classes Mathematical optimization Structural complexity theory Analysis of algorithms P versus NP problem NP-complete NP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics | A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CA[removed]Add to Reading ListSource URL: stuff.mit.eduDownload Document from Source WebsiteFile Size: 180,90 KBShare Document on Facebook |
Training a 3-node neural network is NP-completeDocID: 1uqPp - View Document | |
CCCG 2011, Toronto ON, August 10–12, 2011 Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel∗ Erik D. Demaine†DocID: 1uhJD - View Document | |
Ng Kong Beng Public Lecture Series 黄光明公开讲座 For the past 40 years computer scientists generally believed that NP-complete problems are intractable. In particular, Boolean satisfiability (SAT), as a paradigmaDocID: 1udfk - View Document | |
EPJ Web of Conferences 165, ) NPA8 2017 DOI: epjconfA fast and complete GEANT4 and ROOT Object-Oriented Toolkit:DocID: 1tPVt - View Document | |
Djinni 2.1 Approximating NP-Complete Problems, Fast Jeff Ohlmann, Barrett Thomas, Robert Hansen, Tristan Thiede Presented at OSCON 2006DocID: 1tIrp - View Document |