NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
751	k Newsletter of the Parameterized Complexity Community fpt.wikidot.com www.fpt.wikidot.com Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2014-10-14 03:31:39 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity Michael Fellows Kernelization Clique problem Vertex cover Path decomposition Theoretical computer science Computational complexity theory Applied mathematics
752	Concurrent Bounded Model Checking Quoc-Sang Phan Pasquale Malacaria ˘ areanu Add to Reading List Source URL: www.eecs.qmul.ac.uk Language: English - Date: 2015-04-10 18:09:41 Formal methods Logic in computer science Electronic design automation NP-complete problems Model checking Java Pathfinder Satisfiability Modulo Theories Concolic testing KeY Theoretical computer science Applied mathematics Mathematics
753	Local reductions Hamid Jahanjou∗ Eric Miles∗ Emanuele Viola∗ Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2014-04-01 09:13:02 Complexity classes Circuit complexity Boolean algebra NP-complete problems Time complexity ACC0 Cook–Levin theorem P NC Theoretical computer science Computational complexity theory Applied mathematics
754	Journal of Artificial Intelligence Research234 Submitted 8/14; published 1/15 On the Subexponential-Time Complexity of CSP Ronald de Haan Add to Reading List Source URL: www.jair.org Language: English - Date: 2015-01-30 21:27:29 Constraint programming Constraint satisfaction problem Constraint satisfaction Exponential time hypothesis Boolean satisfiability problem NP-complete Tree decomposition Conjunctive normal form Time complexity Theoretical computer science Applied mathematics Computational complexity theory
755	The Mathematics of Algorithm Design about all these algorithms without recourse to specific computing devices or computer programming languages, instead expressing them using the language of mathematics. In fact, the not Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2006-02-14 23:00:29 Complexity classes Mathematical optimization NP-complete problems Operations research Travelling salesman problem Algorithm Minimum spanning tree Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
756	Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT ? Alberto Griggio1 , Quoc-Sang Phan2 , Roberto Sebastiani2 and Silvia Tomasi2 Add to Reading List Source URL: disi.unitn.it Language: English - Date: 2011-10-12 05:34:03 Mathematics Logic in computer science NP-complete problems Electronic design automation Formal methods Satisfiability Modulo Theories WalkSAT Resolution Local search Theoretical computer science Constraint programming Applied mathematics
757	MLRG: Bayes. Net. Complexity Kui Tang Background Definitions Add to Reading List Source URL: kui-tang.com Language: English Complexity classes Bayesian statistics Graphical models Statistical models Bayesian network NP P-complete Belief propagation Reduction Theoretical computer science Computational complexity theory Applied mathematics
758	Journal of Artificial Intelligence Research606 Submitted 11/07; publishedSATzilla: Portfolio-based Algorithm Selection for SAT Lin Xu Add to Reading List Source URL: www.jair.org Language: English - Date: 2008-07-01 13:34:37 NP-complete problems Logic in computer science Electronic design automation Formal methods Boolean algebra Boolean satisfiability problem Algorithm Computational complexity theory Solver Theoretical computer science Applied mathematics Mathematics
759	The Complexity of Degree Anonymization by Vertex Addition Robert Bredereck? , Vincent Froese?? , Sepp Hartung, Andr´e Nichterlein, Rolf Niedermeier, and Nimrod Talmon? ? ? Institut f¨ ur Softwaretechnik und Theoretisch Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-04-17 07:44:41 NP-complete problems Degree Tree Independent set Clique Connectivity Vertex Graph Neighbourhood Graph theory Theoretical computer science Mathematics
760	To appear in the Intl. J. of Robotics Research Also Technical Report CRES, Center for Robotics and Embedded Systems, USC, July 2003 A formal analysis and taxonomy of task allocation in multi-robot systems Brian P. Add to Reading List Source URL: cres.usc.edu Language: English - Date: 2004-06-08 10:49:29 Operations research Linear programming Combinatorial optimization NP-complete problems Greedy algorithm Robot Assignment problem Algorithm Set cover problem Mathematics Theoretical computer science Applied mathematics

UPDATE