NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
461	CS 373: Combinatorial Algorithms, Fall 2000 Homework 6 (due December 7, 2000 at midnight) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:14 NP-complete problems Complexity classes NP-complete NP-hard NP Maximum cut Shortest path problem Travelling salesman problem P-complete Theoretical computer science Computational complexity theory Mathematics
462	Subexponential Algorithms for Unique Games and Related problems Sanjeev Arora∗ Boaz Barak† Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2011-10-10 23:52:57 NP-complete problems Graph coloring Vertex cover Graph isomorphism problem Matching Graph operations Cycle rank Graph theory Theoretical computer science Mathematics
463	CS 373: Combinatorial Algorithms, Spring 2001 http://www-courses.cs.uiuc.edu/~cs373 Homework 6 (due Tue. May 1, 2001 at 11:59.99 p.m.) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:52:35 NP-complete problems Complexity classes NP-complete NP-hard NP Travelling salesman problem Vertex cover Maximum cut Shortest path problem Theoretical computer science Computational complexity theory Mathematics
464	Distributed Computing FS 2013 Prof. R. Wattenhofer Michael K¨onig Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:46 Mathematics NP-complete problems Hamiltonian path Connectivity Distributed hash table Graph theory Theoretical computer science Distributed data storage
465	Computing Full Disjunctions∗ (Extended Abstract) Yaron Kanza Yehoshua Sagiv Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-07-05 10:44:30 Combinatorial optimization Matching Tree Graph factorization Graph coloring NP-complete problems Computational problems Edge coloring Graph theory Theoretical computer science Mathematics
466	LNCSA Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:26:19 Analysis of algorithms NP-complete problems Parameterized complexity Kernelization Dominating set Time complexity Algorithm Mathematical optimization NP Theoretical computer science Computational complexity theory Applied mathematics
467	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:29:26 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Time complexity Approximation algorithm Rectilinear Steiner tree Theoretical computer science Graph theory Computational complexity theory
468	ICS 260 – Fall 2001 – Final Exam Name: Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-12-12 17:36:38 Complexity classes NP-complete problems Mathematical optimization Operations research Travelling salesman problem NP Induced path Independent set Directed acyclic graph Theoretical computer science Graph theory Computational complexity theory
469	An O(ND) Difference Algorithm and Its Variations∗ EUGENE W. MYERS Department of Computer Science, University of Arizona, Tucson, AZ 85721, U.S.A. ABSTRACT Add to Reading List Source URL: xmailserver.org Language: English - Date: 2007-02-16 03:04:45 Operations research NP-complete problems Dynamic programming Equations Systems engineering Shortest path problem Longest common subsequence problem Graph Catalan number Mathematics Theoretical computer science Graph theory
470	Program Verification as Satisfiability Modulo Theories Nikolaj Bjørner Microsoft Research Ken McMillan Microsoft Research Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2012-08-15 16:20:10 Applied mathematics Electronic design automation Logic in computer science NP-complete problems Constraint programming Satisfiability Modulo Theories Boolean satisfiability problem Prolog Predicate transformer semantics Theoretical computer science Mathematics Formal methods

UPDATE