NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
291	Five $1,000 Problems - John H. Conway! ! ! ! Add to Reading List Source URL: cheswick.com Language: English - Date: 2014-10-13 09:47:48 Graph theory Graph Thrackle Path NP-complete problems Hamiltonian path Skew-symmetric graph
292	R Foundations and Trends in Theoretical Computer Science Vol. 9, No–210 c 2014 S. Sachdeva and N. K. Vishnoi Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2014-04-08 16:25:54 Mathematics Algebra Mathematical analysis Matrix theory NP-complete problems Numerical analysis Polynomial Approximation theory Pi Chebyshev polynomials Eigenvalues and eigenvectors Matrix
293	b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1 Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-02-09 09:55:11 Graph theory Graph coloring Matching NP-complete problems Combinatorial optimization Graph operations Blossom algorithm Bipartite graph Chordal graph Complete coloring Cograph Ear decomposition
294	Real Time Recovery in Berth Allocation Problem in Bulk Ports Nitish Umang Michel Bierlaire STRC 2012 Add to Reading List Source URL: www.strc.ch Language: English - Date: 2012-05-16 12:57:38 Operations research NP-complete problems Berth allocation problem Berth Optimization problem Mathematical optimization Ship Mathematics Systems science Applied mathematics
295	Packing Squares into a Square is Strongly NP-complete 𝑥𝑥 𝑥𝑥 𝐵𝐵 + 𝑎𝑎𝑖𝑖 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2014-10-14 11:01:11
296	Fixed-Parameter Tractability of Token Jumping on Planar Graphs arXiv:1406.6567v2 [cs.DM] 11 MarTakehiro Ito1 , Marcin Kami´ Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-03-11 21:08:35 Graph theory NP-complete problems Planar graphs Independent set Graph Matching Ear decomposition Clique Bipartite graph Line graph Chordal graph
297	Simple Folding is Strongly NP-Complete Hugo A. Akitaya∗ Erik D. Demaine† Jason S. Ku‡ Add to Reading List Source URL: fwcg14.cse.uconn.edu Language: English - Date: 2014-11-05 17:17:51
298	SEAProgram Monday, June 29th 8:00 8:50 9:00 Add to Reading List Source URL: sea2015.lip6.fr Language: English - Date: 2015-06-14 11:10:18 NP-complete problems Computational complexity theory Steiner tree problem Combinatorial optimization Shortest path problem Mathematical optimization Independent set Combinatorics Graph theory Book:Graph Theory
299	Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel and Erik D. Demaine, CCCG 2011 Add to Reading List Source URL: zacharyabel.com - Date: 2016-01-24 17:37:25
300	LNCSA Tutorial on Satisfiability Modulo Theories Add to Reading List Source URL: yices.csl.sri.com Language: English - Date: 2015-12-11 18:43:06 Theoretical computer science Mathematical logic Mathematics Constraint programming Automated theorem proving Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem DPLL algorithm Symbol Conjunctive normal form

UPDATE