NP-hard - PDFSEARCH.IO - Document Search Engine

NP-hard
Results: 119

#	Item
81	Ann Math Artif Intell[removed]:7–26 DOI[removed]s10472[removed]Is computational complexity a barrier to manipulation? Toby Walsh Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2012-01-27 09:53:34 Single winner electoral systems Applied mathematics Psephology Voting theory Single Transferable Vote NP-hard Borda count Voting system NP-complete Theoretical computer science Complexity classes Voting
82	Journal of Artificial Intelligence Research[removed]Submitted 11/10; published[removed]Where Are the Hard Manipulation Problems? Toby Walsh Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2011-09-28 21:59:58 Voting Social choice theory Single winner electoral systems Mathematical optimization NP-hard NP-complete NP Computational complexity theory Instant-runoff voting Complexity classes Single Transferable Vote Political philosophy
83	Measuring Rationality with the Minimum Cost of Revealed Preference Violations Mark Dean and Daniel Martin Online Appendices - Not for Publication Add to Reading List Source URL: www.econ.brown.edu Language: English - Date: 2013-06-19 07:39:31 Complexity classes NP-complete problems Mathematical optimization Structural complexity theory NP-complete NP-hard P versus NP problem NP Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
84	covering-revision-without-comments.dvi Add to Reading List Source URL: dss.in.tum.de Language: English - Date: 2013-01-24 06:29:17 Complexity classes NP-hard NP-complete P versus NP problem NP Polynomial hierarchy Polynomial P Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
85	Food security_Layout Hard back.indd Add to Reading List Source URL: www.nccr.org.np Language: English - Date: 2014-08-13 03:33:28 Food and drink Food security Humanitarian aid Security Urban agriculture Development Fund Kathmandu Nepal Hunger Newar Food politics Asia
86	Book-Contested Development hard back.indd Add to Reading List Source URL: www.nccr.org.np Language: English - Date: 2014-08-13 02:39:59 Nepal Kathmandu International development Nepalese Civil War Newar Asia Unified Communist Party of Nepal
87	The Traveling Salesman (& J ) Peter G. Anderson, Computer Science Department Rochester Institute of Technology, Rochester, New York [removed] Add to Reading List Source URL: www.cs.rit.edu Language: English - Date: 2003-06-11 09:35:55 Complexity classes NP-complete problems Operations research Mathematical optimization Spanning tree Travelling salesman problem Minimum spanning tree NP-hard NP-complete Theoretical computer science Computational complexity theory Applied mathematics
88	Improved Generic Algorithms for Hard Knapsacks? Anja Becker1,?? , Jean-S´ebastien Coron3 , and Antoine Joux1,2 1 University of Versailles Saint-Quentin-en-Yvelines 2 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2011-08-31 08:22:53 NP-complete problems Combinatorial optimization Cryptography Knapsack problem Operations research Theoretical computer science Applied mathematics Dynamic programming
89	The H-index can be easily manipulated arXiv:1304.2557v3 [cs.CC] 12 Sep 2013 Bart de Keijzer ∗ Add to Reading List Source URL: bart.pakvla.nl Language: English - Date: 2014-01-30 11:08:58 Multiset Combinatorics 3-partition problem Partition problem Partition Cardinality NP-hard Multiplicity NP Mathematics Theoretical computer science Complexity classes
90	The H-index can be easily manipulated Bart de Keijzer ∗ Krzysztof R. Apt † Abstract Add to Reading List Source URL: bart.pakvla.nl Language: English - Date: 2014-01-30 11:08:48 3-partition problem Partition problem Partition Cardinality NP-hard Multiplicity Incidence algebra Inclusion–exclusion principle Mathematics Multiset Combinatorics

UPDATE