NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
701	LNCS 5123 - <TEX>{CSIsat}</TEX>: Interpolation for LA+EUF Add to Reading List Source URL: www.sosy-lab.org Language: English - Date: 2013-10-11 06:59:10 Constraint programming Electronic design automation Formal methods Logic in computer science NP-complete problems Interpolation Satisfiability Modulo Theories Solver Linear programming Theoretical computer science Applied mathematics Mathematics
702	Defining lines of maximum probability for the design of patrol vessel itineraries Fernando Bação1 Victor Lobo2 1 ISEGI-UNL Add to Reading List Source URL: itcnt05.itc.nl Language: English - Date: 2008-09-22 04:53:24 NP-complete problems Operations research Neural networks Dimension reduction Travelling salesman problem Self-organizing map SOM NP Theoretical computer science Computational complexity theory Applied mathematics
703	T h r e e Generative, Lexicalised M o d e l s for Statistical Parsing M i c h a e l Collins* D e p t . of C o m p u t e r a n d I n f o r m a t i o n Science University of Pennsylvania P h i l a d e l p h i a , P A , 191 Add to Reading List Source URL: www.aclweb.org Language: English - Date: 2010-06-15 04:30:58 Science Mathematical optimization Formal languages NP-complete NP Treebank Parse tree Syntax Stochastic context-free grammar Linguistics Theoretical computer science Complexity classes
704	Efficient Algorithms for Eulerian Extension and Rural Postman∗ Frederic Dorn† Hannes Moser‡¶ Mathias Weller§k Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-01-23 08:47:12 Route inspection problem Multigraph Graph Line graph Degree Directed graph Clique Shortest path problem BEST theorem Graph theory NP-complete problems Eulerian path
705	Noname manuscript No. (will be inserted by the editor) On Tractable Cases of Target Set Selection Andr´ Add to Reading List Source URL: www.akt.tu-berlin.de Language: English - Date: 2012-06-07 13:36:43 NP-complete problems Vertex cover Kernelization Feedback vertex set Clique Dominating set Tree decomposition Graph Vertex Graph theory Theoretical computer science Mathematics
706	A Refined Complexity Analysis of Degree Anonymization in GraphsI Sepp Hartunga , Andr´e Nichterleina , Rolf Niedermeiera , Ondˇrej Such´ yb a Institut Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-09-29 07:15:40 NP-complete problems Kernelization Graph coloring Clique Independent set Degree Neighbourhood Degeneracy Parameterized complexity Graph theory Theoretical computer science Mathematics
707	On the complexity of searching for an evader with a faster pursuer Florian Shkurti1 and Gregory Dudek1 Abstract— In this paper we examine pursuit-evasion games in which the pursuer has higher speed than the evader. Thi Add to Reading List Source URL: www.cim.mcgill.ca Language: English - Date: 2013-05-18 17:31:04 Search algorithms Pursuit-evasion game theory Shortest path problem NP-complete Planar graph Breadth-first search Binary tree Depth-first search Graph theory Theoretical computer science Mathematics
708	Problem Solving Methods ___________ Methods Checklist Use to record the range of methods you know, use or/and have experienced. Notice methods that may need development. Solve a problem in several ways using different m Add to Reading List Source URL: schools.reap.org.nz Language: English - Date: 2014-10-23 07:13:05 Education Neuropsychological assessment Problem solving Mathematical problem Problem Theoretical computer science NP-complete How to Solve It Mathematics Mathematics education Educational psychology
709	Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics
710	Effective and Efficient Data Reduction for the Subset Interconnection Design Problem? Jiehua Chen1 , Christian Komusiewicz1 , Rolf Niedermeier1 , Manuel Sorge1 , Ondˇrej Such´ y2 , and Mathias Weller3 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-10-09 05:34:13 Hypergraph Graph Vertex cover Constraint programming Kernelization Graph theory Theoretical computer science NP-complete problems

UPDATE