NP-completeness - PDFSEARCH.IO - Document Search Engine

NP-completeness
Results: 54

#	Item
1	Informatique Fondamentale IMA S8 Cours 4 : graphs, problems and algorithms on graphs, (notions of) NP completeness Laure Gonnord http://laure.gonnord.org/pro/teaching/ Add to Reading List Source URL: laure.gonnord.org Language: English
2	The Subset Sum Problem Reducing Time Complexity of NP-Completeness with Quantum Search Abstract The Subset Sum Problem is a member of the NPcomplete class, so no known polynomial time algorithm exists for it. Although th Add to Reading List Source URL: ciim.usf.edu - Date: 1980-01-01 00:00:00
3	CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-01-06 16:13:01 Computational complexity theory Theory of computation Complexity classes NP Clique problem Linear programming P Algorithm Time complexity Optimization problem Book:Graph Theory P versus NP problem
4	Part I: Introduction Part II: Solution The complexity of Sur-Hom(C∗4 ) Barnaby Martin and Dan¨ıel Paulusma Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2011-09-12 12:52:00 Mathematics Morphisms Complexity classes Graph theory Mathematical logic Structure Universal algebra NP-completeness Graph homomorphism Bipartite graph Homomorphism NP
5	A PTAS for the Highway Problem Fabrizio Grandoni & Thomas Rothvo Institute of Mathemati s EPFL, Lausanne The Highway Problem Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Complexity classes Theory of computation Polynomial-time approximation scheme APX Strong NP-completeness NP
6	Bin Pa king via Dis repan y of Permutations F. Eisenbrand, D. Palv olgyi & T. Rothvo Cargese Workshop 2010 Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Theory of computation Complexity classes Strong NP-completeness Polynomial-time approximation scheme Bin Packing problems NP-complete problems Bin packing problem
7	CS681: Advanced Topics in Computational Biology Week 7 Lectures 2-3 Can Alkan EA224 Add to Reading List Source URL: www.cs.bilkent.edu.tr Language: English - Date: 2012-03-26 04:52:47 Graph theory Mathematics Computational complexity theory NP-complete problems Hamiltonian path Eulerian path Travelling salesman problem Cycle Seven Bridges of Knigsberg Path NP-completeness Shortest path problem
8	SAT Instances for Termination Analysis with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany Add to Reading List Source URL: www.dcs.bbk.ac.uk Language: English - Date: 2009-06-09 05:12:21 Theoretical computer science Logic in computer science Formal languages Hans Zantema International Conference on Rewriting Techniques and Applications Rewriting Termination analysis Divergence NP-completeness
9	Aachen Department of Computer Science Technical Report SAT Encodings: From Constraint-Based Termination Add to Reading List Source URL: sunsite.informatik.rwth-aachen.de Language: English - Date: 2012-10-02 11:28:08 Logic in computer science Mathematical logic Aachen RWTH Aachen University Termination analysis Boolean satisfiability problem NP-completeness Algorithm Rewriting
10	Safety to the Weak! Security Through Feebleness: An Unorthodox Manifesto Rick McGeer, US Ignite Outline Add to Reading List Source URL: spw16.langsec.org Language: English - Date: 2016-06-05 23:40:05 Hardware description languages Turing machine Formal methods Theoretical computer science Verilog VHDL Turing completeness NP Formal verification High-level synthesis Verilog-AMS

UPDATE