NP-hard - PDFSEARCH.IO - Document Search Engine

NP-hard
Results: 119

#	Item
71	Part III Michaelmas 2012 COMPUTATIONAL COMPLEXITY EXERCISE SHEET 1: Turing machines Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2013-10-08 12:31:35 Complexity classes Structural complexity theory Mathematical optimization Analysis of algorithms NP-complete P versus NP problem NP-hard NP Bounded-error probabilistic polynomial Theoretical computer science Computational complexity theory Applied mathematics
72	Some hard graph problems in telecoms Keith Briggs Add to Reading List Source URL: keithbriggs.info Language: English - Date: 2006-10-27 09:09:17 NP-complete problems Graph coloring Graph operations Clique Independent set Graph Graph bandwidth Graph theory Theoretical computer science Mathematics
73	Subsequence Matching (Embedding) Querying and Embedding Compressed Texts INPUT: pattern TEAM and text I N T E R N A T I ON A L S YMP O S I UM Add to Reading List Source URL: yury.name Language: English - Date: 2006-08-27 15:04:00 Mathematics Compressed pattern matching NP-hard NP Yuri Matiyasevich Embedding problem Theoretical computer science Complexity classes Applied mathematics
74	HARD SUDOKU PUZZLES 9 1 Add to Reading List Source URL: www.puzzlexpress.com Language: English - Date: 2005-11-16 13:40:25 Recreational mathematics Games Puzzle video games Sudoku Puzzle Mathematical puzzle Sudoku algorithms Mathematics of Sudoku Mathematics Logic puzzles NP-complete problems
75	On Teaching the Basics of Complexity Theory (In Memory of Shimon Even [1935{2004]) Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Israel. Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:25:22 Complexity classes NP-complete NP-hard P versus NP problem Co-NP NP Cook–Levin theorem Oracle machine Reduction Theoretical computer science Computational complexity theory Applied mathematics
76	How Hard Is It to Control an Election by Breaking Ties? Nicholas Mattei1 and Nina Narodytska2 and Toby Walsh3 Abstract. We study the computational complexity of controlling the result of an election by breaking ties stra Add to Reading List Source URL: www.nickmattei.net Language: English - Date: 2014-12-04 03:20:52 Political philosophy Social choice theory Electoral systems Voting systems Psephology Borda count Approval voting NP-complete NP-hard Single winner electoral systems Voting Complexity classes
77	Frank Nack University of Amsterdam, [removed] Media Beat Content is Dead[removed]Long Live Add to Reading List Source URL: users.cecs.anu.edu.au Language: English - Date: 2014-03-20 22:39:43 Complexity classes NP-complete P versus NP problem NP-hard AI-complete NP Boolean satisfiability problem Oracle machine Complete Theoretical computer science Computational complexity theory Applied mathematics
78	Metaphor Computing Dan Fu Matt Bishop Stottler Henke Associates, Inc. Add to Reading List Source URL: www.stottlerhenke.com Language: English - Date: 2010-10-11 16:01:17 Cognitive science Theoretical computer science George Lakoff Psycholinguists Metaphor Virtual world NP-hard Algorithm NP-complete Literature Complexity classes Applied mathematics
79	Pushmeet Kohli Microsoft Research E(x) x in {0,1}n Add to Reading List Source URL: imagine.enpc.fr Language: English - Date: 2014-07-01 10:36:42 Submodular set function P NP-hard Maximum cut Theoretical computer science Complexity classes Applied mathematics
80	CS 330 – Spring 2013, Assignment 6 Problems due in the drop-box by 5PM, Thursday, April 18th (Monday schedule that day) Late assignments will only be accepted up until 5PM on Friday, April 19th Question[removed]pts). Cha Add to Reading List Source URL: www.cs.bu.edu Language: English - Date: 2013-04-05 16:53:19 Applied mathematics NP-complete NP P P versus NP problem NP-hard Theoretical computer science Computational complexity theory Complexity classes

UPDATE