NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
801	Chapter 5: Hard Problems Quotation Algorithmic Adventures From Knowledge to Magic Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2011-10-24 15:11:43 Complexity classes Dynamic programming NP-complete problems Operations research P versus NP problem Time complexity Knapsack problem P Subset sum problem Theoretical computer science Computational complexity theory Applied mathematics
802	Parameterized Algorithms and Circuit Lower Bounds Ryan Williams Stanford Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-02-02 11:07:07 Complexity classes Mathematical optimization Structural complexity theory Computational resources P versus NP problem NP-complete Circuit complexity P Time hierarchy theorem Theoretical computer science Computational complexity theory Applied mathematics
803	WO RKSHO P O N PARAM ETERI ZED CO M PLEXI TY http:/ / fpt.wikidot.com 30&31 March 2010 The University of Newcastle, AU ABSTRACTS OF TALKS Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:49:01 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity NP-complete Vertex cover Time complexity Travelling salesman problem Matching Theoretical computer science Computational complexity theory Applied mathematics
804	Minimum Manhattan Network is NP-Complete Francis Y. L. Chin Zeyu Guo He Sun Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2009-05-16 03:15:13 Inspector Gadget C programming language Struct Gadget
805	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
806	Fixed-Parameter Algorithms for Covering Points with Lines Apichat Heednacram PhD Student Supervisors: Prof. Vladimir Estivill-Castro Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:11:27 Parameterized complexity Analysis of algorithms Time complexity NP-complete problems Algorithm Theoretical computer science Applied mathematics Computational complexity theory
807	Claw-free graphs and two conjectures on omega, Delta, and chi Andrew King School of Computer Science McGill University, Montreal October 2009 Add to Reading List Source URL: andrewdouglasking.com.s3-website-us-west-2.amazonaws.com Language: English - Date: 2015-03-20 01:35:59 Graph operations Line graph Claw-free graph Clique Perfect graph Chordal graph Interval graph Neighbourhood Graph property Graph theory Graph coloring NP-complete problems
808	Incremental List Coloring of Graphs, Parameterized by Conservation2 Sepp Hartung and Rolf Niedermeier TU Berlin Institut f¨ ur Softwaretechnik und Theoretische Informatik Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-02-01 23:13:02 Graph coloring NP-complete problems Analysis of algorithms Parameterized complexity List coloring Graph Travelling salesman problem Kernelization Edge coloring Graph theory Theoretical computer science Mathematics
809	Welcome • September 10th (Fri) – Final version due Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter. Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:19:59 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Feedback vertex set Dominating set Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
810	The Online Set Cover Problem (Extended Abstract) Noga Alon∗ Baruch Awerbuch† Add to Reading List Source URL: www.cs.jhu.edu Language: English - Date: 2007-10-09 11:17:36 Analysis of algorithms NP-complete problems Probabilistic complexity theory Randomized algorithm Set cover problem Competitive analysis Algorithm Randomized rounding Euclidean algorithm Mathematics Theoretical computer science Applied mathematics

UPDATE