NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
271	Approximation algorithms for mixed, windy, and capacitated arc routing problems René van Bevern1 , Christian Komusiewicz2 , and Manuel Sorge2 1 2 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-08-10 10:23:26 Dynamic programming Routing algorithms Eulerian path Shortest path problem FloydWarshall algorithm NP-complete problems Planar separator theorem Dominating set
272	JMLR: Workshop and Conference Proceedings vol 40:1–17, 2015 Label optimal regret bounds for online local learning Pranjal Awasthi∗ PAWASHTI @ CS . PRINCETON . EDU Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:35 NP-complete problems Analysis of algorithms Clique problem Planted clique Time complexity Clique Matching Big O notation Matching polynomial Graph coloring
273	Sheep: A Scalable Distributed Graph Partitioner Daniel Margo Margo Seltzer Algorithm Problem Add to Reading List Source URL: acmsocc.github.io Language: English - Date: 2016-02-21 03:10:50 Graph theory NP-complete problems Bipartite graphs Graph Tree Graph coloring Pathwidth Modular decomposition
274	GraphLab: A New Framework For Parallel Machine Learning Yucheng Low Carnegie Mellon University Add to Reading List Source URL: select.cs.cmu.edu Language: English - Date: 2010-06-15 17:18:40 Graph theory Concurrent computing Mathematics Parallel computing Distributed computing architecture NP-complete problems Graph connectivity MapReduce Speedup Graph coloring Spanning tree Graph partition
275	Artificial Intelligence–123 Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search ✩ XuanLong Nguyen 1 , Subbarao Kambhampati ∗ , Romeo S. Nigenda Depart Add to Reading List Source URL: rakaposhi.eas.asu.edu Language: English - Date: 2009-07-17 17:36:19 Mathematics Heuristics Cognition Game artificial intelligence Routing algorithms Search algorithms NP-complete problems A* search algorithm Applied mathematics Admissible heuristic Algorithm 15 puzzle
276	Statistical Algorithms and a Lower Bound for Detecting Planted Cliques Vitaly Feldman Almaden Research Center IBM San Jose, CA 95120 Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2013-03-20 23:48:10 NP-complete problems Clique problem Approximation algorithm Probability distributions Dominating set
277	arXiv:1106.2436v3 [cs.LG] 25 OctFrom Bandits to Experts: On the Value of Side-Observations Ohad Shamir Microsoft Research New England Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-10-26 04:59:45 Graph theory NP-complete problems Independent set Matching Clique Ear decomposition Graph coloring Trapezoid graph
278	Protocol Insecurity with a Finite Number of Sessions and Composed Keys is NP-complete∗ Michaël Rusinowitch and Mathieu Turuani LORIA-INRIA- Université Henri Poincaré, 54506 Vandoeuvre-les-Nancy cedex, France email:{ Add to Reading List Source URL: www.loria.fr Language: English - Date: 2003-03-20 10:40:14
279	Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004 Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2008-02-01 14:51:28 Computational complexity theory Theory of computation Complexity classes NP-complete problems Mathematical optimization NP-hard problems MAX-3SAT NP Approximation algorithm Probabilistically checkable proof PCP theorem APX
280	Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007 Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2014-10-22 08:43:20 Graph theory Mathematics NP-complete problems NP-hard problems Operations research Travelling salesman problem Matching Eulerian path Hamiltonian path Minimum spanning tree Cycle Line graph

UPDATE