NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
391	BRICS Basic Research in Computer Science BRICS RSAceto et al.: Checking Consistency of Pedigree Information is NP-complete Checking Consistency of Add to Reading List Source URL: www.brics.dk Language: English - Date: 2002-10-31 09:14:47 Philosophy of biology Genetic linkage Genotype Heredity Dominance Phenotypic trait Recessive Introduction to genetics Phenotype Genetics Classical genetics Biology
392	BRICS Basic Research in Computer Science BRICS RSJ. M. Nielsen: On the Number of Maximal Independent Sets in a Graph On the Number of Maximal Independent Sets Add to Reading List Source URL: www.brics.dk Language: English - Date: 2002-04-12 04:11:55 NP-complete problems Maximal independent set Independent set Graph coloring Clique Extremal graph theory Domatic number Path decomposition Graph theory Theoretical computer science Mathematics
393	Mathematical Programming manuscript No. (will be inserted by the editor) Sanjeev Arora ? Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2007-02-04 13:37:22 NP-complete problems Complexity classes Approximation algorithms Spanning tree Travelling salesman problem Polynomial-time approximation scheme Time complexity Optimization problem Algorithm Theoretical computer science Computational complexity theory Applied mathematics
394	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:42:05 NP-complete problems Clique Travelling salesman problem Vertex cover NP-complete Cut Path decomposition Feedback vertex set Graph theory Theoretical computer science Mathematics
395	Shibuya et al. Algorithms for Molecular Biology 2010, 5:7 http://www.almob.org/contentRESEARCH Open Access Add to Reading List Source URL: www.almob.org Language: English Protein methods Bioinformatics Complexity classes Computational complexity theory Root-mean-square deviation Mathematical optimization Structural alignment Time complexity NP-complete Theoretical computer science Applied mathematics Statistics
396	UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 23 May 1, 2003 Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 NP-complete problems Complexity classes Bin packing problem NP Subset sum problem Partition problem Vertex cover Integer 3-partition problem Theoretical computer science Mathematics Computational complexity theory
397	arXiv:0909.2005v1 [cs.DS] 10 SepDeterministic approximation for the cover time of trees Uriel Feige∗ Add to Reading List Source URL: arxiv.org Language: English - Date: 2009-09-10 14:01:15 Analysis of algorithms SL Randomized algorithm Connectivity NP-complete problems Graph coloring Theoretical computer science Computational complexity theory Applied mathematics
398	Directing Complete Graphs and Avoiding Certain Structures January 31, 2015 The avoiding problem is defined as follows: the inputs consists of a simple Add to Reading List Source URL: payam-research.atwebpages.com Language: English - Date: 2015-01-31 03:24:13 NP-complete problems Morphisms Longest path problem Network theory Graph homomorphism Graph theory Theoretical computer science Mathematics
399	Sets with Cardinality Constraints in Satisfiability Modulo Theories Philippe Suter? , Robin Steiger, and Viktor Kuncak ´ Ecole Polytechnique F´ed´erale de Lausanne (EPFL), Switzerland Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2010-11-10 10:57:45 Metalogic Formal methods Model theory Logic in computer science NP-complete problems First-order logic Satisfiability Modulo Theories Function Interpretation Logic Mathematics Theoretical computer science
400	Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems Moses Charikar∗ Konstantin Makarychev∗† Add to Reading List Source URL: konstantin.makarychev.net Language: English - Date: 2014-06-08 22:16:07 Operations research NP-complete problems Linear programming Real algebraic geometry Semidefinite programming 2-satisfiability Mathematical optimization Constraint satisfaction problem Constraint satisfaction Theoretical computer science Applied mathematics Computational complexity theory

UPDATE