NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
661	A Local-Search 2-Approximation for 2-Correlation-Clustering? Tom Coleman, James Saunderson, and Anthony Wirth The University of Melbourne Abstract. CorrelationClustering is now an established problem in Add to Reading List Source URL: tom.thesnail.org Language: English - Date: 2015-05-04 03:09:24 NP-complete problems Matroid theory Spanning tree Signed graph Clique Graph Tree Eulerian path Pseudoforest Graph theory Theoretical computer science Mathematics
662	Flexible Graph Partitioning of Power Grids with Peer-to-peer Electricity Exchange Kazuhiro Minami, Tomoya Tanjo, Nana Arizumi, Hiroshi Maruyama Institute of Statistical Mathematics, Tokyo, Japan Email: {kminami, tanjo, a Add to Reading List Source URL: systemsresilience.org Language: English - Date: 2014-12-15 22:25:12 Network flow NP-complete problems Graph partition Graph operations Maximum flow problem Topology Flow network Connectivity Planar separator theorem Graph theory Theoretical computer science Mathematics
663	Problem Solving Methods ___________ Methods Checklist Use to record the range of methods you know, use or/and have experienced. Notice methods that may need development. Solve a problem in several ways using different m Add to Reading List Source URL: schools.reap.org.nz Language: English - Date: 2014-10-23 07:12:58 Education Neuropsychological assessment Problem solving Mathematical problem Problem Theoretical computer science NP-complete How to Solve It Mathematics Mathematics education Educational psychology
664	Compactness-Preserving Mapping on Trees Jan Baumbach, Jiong Guo, Rashid Ibragimov Network Alignment Comparison of networks/graphs Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2014-06-13 17:44:22 Graph theory Complexity classes NP Graph isomorphism NP-complete problems Theoretical computer science Computational complexity theory Mathematics
665	SOS Lecture 2: Max Cut, Sparsest Cut, Small Set Expansion and some relations of Isoperimetry and Hypercontractivity / Boaz Barak Lecture notes by Adrian Vladu and Henry Yuen Suggested reading • As I mentioned in the em Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2014-10-29 13:20:10 Combinatorial optimization Degree Cut NP-complete problems Combinatorics Randomized algorithm Euclidean algorithm Mathematics Graph theory Theoretical computer science
666	Practical Partition-Based Theorem Proving for Large Knowledge Bases Sheila McIlraith Bill MacCartney Knowledge Systems Lab Knowledge Systems Lab Computer Science Dept. Computer Science Dept. Stanford University Add to Reading List Source URL: www.ksl.stanford.edu Language: English - Date: 2003-06-20 17:12:42 Automated theorem proving Combinatorics NP-complete problems Graph partition Resolution Partition Tree decomposition First-order logic Mathematics Graph theory Theoretical computer science
667	Ventsislav Chonev & Andrew Ker ventsislav.chonev @ oriel.ox.ac.uk adk @ comlab.ox.ac.uk- Oxford University Computing Laboratory Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2011-01-24 20:46:11 Multivariate statistics Mathematical sciences Steganography NP-complete Distortion NP Mahalanobis distance Computer vision Statistics Complexity classes Applied mathematics
668	Implicit Hitting Set Problems, Multi-Genome Alignment and Colorful Connected Subgraphs Richard M. Karp CPM New York, June, 2010 Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2010-08-20 17:45:40 Combinatorics Matroid theory Combinatorial optimization Set cover problem Matroid Feedback vertex set Maximum cut Greedy algorithm Mathematics Theoretical computer science NP-complete problems
669	Algorithms for Three Versions of the Shortest Common Superstring Problem Maxime Crochemore, Marek Cygan, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2010-08-20 17:45:58 Superstring theory Computer science Mathematics Computational complexity theory Approximation algorithm NP-complete
670	Problem Solving Methods ___________ Methods Checklist Use to record the range of methods you know, use or/and have experienced. Notice methods that may need development. Solve a problem in several ways using different m Add to Reading List Source URL: schools.reap.org.nz Language: English - Date: 2015-04-13 04:43:07 Education Neuropsychological assessment Problem solving Mathematical problem Problem Theoretical computer science NP-complete How to Solve It Mathematics Mathematics education Educational psychology

UPDATE