NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
221	E. Sakalauskas The Multivariate Quadratic Power Problem over ZN is NP-Complete N. Surname Application of Multistart Tabu Search to the MAX–CUT Problem N. Surname Add to Reading List Source URL: www.itc.ktu.lt Language: English - Date: 2015-05-26 03:12:57 Metaheuristics Complexity classes Operations research Mathematical optimization Tabu search Algorithm Search algorithm Heuristic Local search Theorem NP
222	1 Doc. Math. J. DMV Games, Complexity Classes, and Approximation Algorithms Joan Feigenbaum Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2001-10-24 10:52:24 Complexity classes PSPACE-complete IP Generalized geography PSPACE PP ArthurMerlin protocol Computational complexity theory NP P NEXPTIME Reduction
223	Monochromatic triangles in two-colored plane V´ıt Jel´ınek Jan Kynˇcl Rudolf Stolaˇr ´ s Valla Tomaˇ Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2007-02-02 08:52:54 Graph coloring NP-complete problems Monochromatic triangle E2
224	An Approximation Algorithm for Bounded Degree Deletion∗ Tom´aˇs Ebenlendr† Petr Kolman‡ Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2009-06-04 05:35:50 NP-complete problems Functional analysis Vertex cover Distribution Graph coloring Dominating set Maximal independent set
225	A semidefinite programming hierarchy for packing problems in discrete geometry David de Laat (TU Delft) Joint work with Frank Vallentin (Universit¨at zu K¨oln) Applications of Real Algebraic Geometry Add to Reading List Source URL: www.daviddelaat.nl Language: English NP-complete problems Operations research Independent set Optimization problem Discrete geometry Graph Duality Packing problems Mathematical optimization Planar graphs Matching Matroid
226	Smoothed Complexity Theory Markus Bl¨aser1 and Bodo Manthey2 1 Saarland University, 2 Add to Reading List Source URL: www-cc.cs.uni-saarland.de Language: English - Date: 2014-01-17 04:45:53 Complexity classes Computational complexity theory Mathematical optimization Analysis of algorithms NP-complete problems Smoothed analysis IP PP NP Time complexity Average-case complexity Boolean satisfiability problem
227	Theoretical Computer Science–2863 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2014-11-26 08:32:25 Computational complexity theory Approximation algorithms Complexity classes Operations research NP-complete problems Polynomial-time approximation scheme Travelling salesman problem Steiner tree problem APX Optimization problem Combinatorial optimization NP
228	1 Distributed Basis Pursuit João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar, and Markus Püschel Abstract—We propose a distributed algorithm for solving the Add to Reading List Source URL: www.ee.ucl.ac.uk Language: English - Date: 2013-07-05 07:45:59 NP-complete problems Algorithm Mathematical logic Theoretical computer science NP Eigenvalues and eigenvectors HeldKarp algorithm Belief propagation
229	Fundamenta Informaticaei–ii i DOIFIIOS Press Add to Reading List Source URL: www.mimuw.edu.pl Language: English - Date: 2010-11-05 06:10:40 Theoretical computer science Constraint programming Electronic design automation Formal methods NP-complete problems Constraint satisfaction Combinatorial optimization Fundamenta Informaticae Satisfiability Mathematical optimization

UPDATE