NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
501	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Distributed Algorithm for Approximate Mobile Sensor Coverage Esther Ezra∗ Jiemin Zeng† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-29 13:44:18 NP-complete problems Complexity classes Approximation algorithms Operations research Set cover problem Polynomial-time approximation scheme Time complexity Linear programming relaxation NP Theoretical computer science Computational complexity theory Applied mathematics
502	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
503	Proofs and Refutations, and Z3 Leonardo de Moura and Nikolaj Bjørner Microsoft Research Abstract Z3 [3] is a state-of-the-art Satisfiability Modulo Theories (SMT) solver freely available from Microsoft Research. It solv Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2009-07-21 19:11:06 Formal methods Metalogic Logic in computer science Electronic design automation NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Conjunctive normal form Mathematical proof Mathematics Theoretical computer science Logic
504	Software Engineering and Automated Deduction Willem Visser Nikolaj Bjørner Natarajan Shankar Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2014-05-07 12:02:12 Formal methods Automated theorem proving Logic in computer science NP-complete problems Model checking Satisfiability Modulo Theories Boolean satisfiability problem KeY First-order logic Theoretical computer science Logic Mathematical logic
505	16th Canadian Conference on Computational Geometry, 2004 Approximating optimal paths in terrains with weight defined by a piecewise-linear function J. A. P´erez Ruy-D´ıaz Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Curves NP-complete problems Network theory Routing algorithms Steiner tree problem Shortest path problem A* search algorithm Catenary Graph Graph theory Mathematics Theoretical computer science
506	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Network Design Subject to Facility Location J. Bhadury∗, R. Chandrasekaran†, L. Gewali‡ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:36 NP-complete problems Spanning tree Network theory Minimum spanning tree Shortest path problem Vertex cover Tree Steiner tree problem Widest path problem Graph theory Theoretical computer science Mathematics
507	A Constraint Solver for Software Engineering: Finding Models and Cores of Large Relational Specifications by Emina Torlak Add to Reading List Source URL: homes.cs.washington.edu Language: English - Date: 2014-08-13 19:26:58 NP-complete problems Constraint programming Logic in computer science Propositional calculus Unsatisfiable core Electronic design automation Boolean satisfiability problem Symmetry Satisfiability Theoretical computer science Mathematics Applied mathematics
508	Why is P Not Equal to N P ? ? Michael Fellows1,2 and Frances Rosamond1 1 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:05:44 Complexity classes NP-complete problems Mathematical optimization Structural complexity theory Parameterized complexity P versus NP problem NP-complete NP-hard NP Theoretical computer science Computational complexity theory Applied mathematics
509	3 in Three: Puzzle Solutions A Guide by John Franklin Version 1.01 — December 1, 2006 This Guide Is Formatted For Print! Multiple puzzle solutions may appear on the same page (and single solutions often Add to Reading List Source URL: www.thefoolsgold.com Language: English - Date: 2006-12-03 02:01:43 Puzzles Mechanical puzzles NP-complete problems Games 3 in Three T puzzle
510	The Euclidean k-Supplier Problem Viswanath Nagarajan1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NYComputer Science Department, Technion, Haifa 32000, Israel Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-10-26 12:29:22 NP-complete problems Analysis of algorithms Combinatorial optimization Matching Spanning tree Planar graph Nearest neighbor search Connectivity Randomized algorithm Graph theory Theoretical computer science Mathematics

UPDATE