NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
1	Ng Kong Beng Public Lecture Series 黄光明公开讲座 For the past 40 years computer scientists generally believed that NP-complete problems are intractable. In particular, Boolean satisfiability (SAT), as a paradigma Add to Reading List Source URL: www2.ims.nus.edu.sg Language: English - Date: 2017-10-25 03:25:49
2	Djinni 2.1 Approximating NP-Complete Problems, Fast Jeff Ohlmann, Barrett Thomas, Robert Hansen, Tristan Thiede Presented at OSCON 2006 Add to Reading List Source URL: conferences.oreillynet.com - Date: 2014-01-16 14:36:50
3	Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved Add to Reading List Source URL: mug.mvapich.cse.ohio-state.edu Language: English - Date: 2015-11-20 13:17:47 Graph theory Mathematics Search algorithms Graph traversal Breadth-first search Vertex NP-complete problems Graph coloring Planar graphs Depth-first search
4	On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon Add to Reading List Source URL: www.mancoosi.org Language: English - Date: 2012-12-16 04:54:55 Theoretical computer science Mathematics Computational complexity theory Operations research Logic in computer science Mathematical optimization NP-complete problems Boolean algebra Maximum satisfiability problem Boolean satisfiability problem Constraint satisfaction Solver
5	Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2012-01-04 04:27:26 Graph theory Bipartite graphs Planar graphs Induced path NP-complete problems Parity graph
6	A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012 Add to Reading List Source URL: www.daviddelaat.nl Language: English Graph theory Mathematics NP-complete problems Information theory Combinatorial optimization NP-hard problems Lovsz number Independent set
7	Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:25 Computational complexity theory Complexity classes NP-complete problems Operations research Combinatorial optimization Mathematical optimization Knapsack problem Reduction Graph coloring NP-hardness NP Optimization problem
8	A Fresh Look on Knowledge Bases: Distilling Named Events from News Erdal Kuzey Jilles Vreeken Add to Reading List Source URL: eda.mmci.uni-saarland.de Language: English - Date: 2014-10-01 09:01:01 Graph theory Mathematics NP-complete problems Network theory Networks Combinatorial optimization Semantic similarity Line graph Centrality Matching Dominating set Graph partition
9	TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems Add to Reading List Source URL: www.ads.tuwien.ac.at Language: English - Date: 2015-02-11 08:09:39 Graph theory Operations research Mathematics Computational complexity theory Network flow NP-complete problems NP-hard problems Travelling salesman problem Multi-commodity flow problem Flow network
10	Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone: Add to Reading List Source URL: students.ceid.upatras.gr Language: English - Date: 2006-02-09 03:56:19 Theoretical computer science Computational complexity theory Mathematics Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Symposium on Discrete Algorithms Approximation algorithm Random walk 2-satisfiability