NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
441	Using Genetic Improvement & Code Transplants to Specialise a C++ Program to a Problem Class Justyna Petke1 , Mark Harman1 , William B. Langdon1 , and Westley Weimer2 1 2 Add to Reading List Source URL: www.genetic-programming.org Language: English - Date: 2014-07-05 17:14:07 Electronic design automation Formal methods Logic in computer science NP-complete problems Mathematical optimization Boolean satisfiability problem Mutation Genetic programming Solver Theoretical computer science Applied mathematics Mathematics
442	The Computer Journal Special Issue on Parameterized Complexity: Foreward by the Guest Editors Rodney G. Downey Victoria University Wellington, New Zealand Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-06 03:04:07 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Dominating set Exponential time hypothesis Feedback vertex set Theoretical computer science Computational complexity theory Applied mathematics
443	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A PTAS for the continuous 1.5D Terrain Guarding Problem Stephan Friedrichs∗ Michael Hemmer∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-28 18:32:50 Group theory Order Optimization problem NP-complete problems Network flow Combinatorial optimization Theoretical computer science Mathematics Computational complexity theory
444	Return of the Boss Problem: Competing Online Against a Non-Adaptive Adversary Magnús M. Halldórsson1 and Hadas Sha hnai2 1 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2010-03-19 09:17:44 NP-complete problems Interval graph Vertex cover Graph coloring Matching Independent set Dominating set Path decomposition Graph theory Theoretical computer science Mathematics
445	On the Pagenumber of Bipartite Orders Mustafa Alhashem∗ Guy-Vincent Jourdan∗ ∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:47 NP-complete problems Order theory Bipartite graph Parity Partially ordered set Covering graph FO Interval graph Vertex cover Graph theory Theoretical computer science Mathematics
446	On Two Class-Constrained Versions of the Multiple Knapsack Problem ∗ Hadas Shachnai † Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-15 10:32:13 Operations research Combinatorial optimization NP-complete problems Mathematical optimization Dynamic programming Knapsack problem Job shop scheduling Optimization problem Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
447	Mode Directed Path Finding Irene M. Ong1 , Inˆes de Castro Dutra2 , David Page1, V´ıtor Santos Costa2 1 2 Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2006-07-20 15:45:54 Game artificial intelligence Constraint programming Network theory Shortest path problem Static single assignment form Hypergraph Pathfinding NP-complete problems Decomposition method Theoretical computer science Mathematics Graph theory
448	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Computational complexity and an integer programming model of Shakashaka Erik D. Demaine∗ Yoshio Okamoto† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:59 Operations research Convex optimization Linear programming Regression analysis NP-complete problems 2-satisfiability Dynamic programming Mathematics Mathematical optimization Theoretical computer science
449	Interconnection Semantics for Keyword Search in XML Sara Cohen∗ Yaron Kanza Technion—Israel Institute of Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2007-11-04 06:34:23 Complexity classes NP-complete problems Logic in computer science Graph connectivity Graph theory Tree Connectivity L Boolean satisfiability problem Theoretical computer science Mathematics Applied mathematics
450	CCCG 2009, Vancouver, BC, August 17–19, 2009 Packing 2 × 2 unit squares into grid polygons is NP-complete Dania El-Khechen∗ 1 Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:19:26 Complexity classes Discrete geometry Packaging Packing problem Sphere packing NP-hard Polygon Induced path NP-complete Theoretical computer science Mathematics Geometry

UPDATE