NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
791	Math. Program., Ser. A manuscript No. (will be inserted by the editor) An Exact Combinatorial Algorithm for Minimum Graph Bisection Daniel Delling · Daniel Fleischman · Add to Reading List Source URL: www.ilyaraz.org Language: English - Date: 2014-12-16 13:53:35 Spanning tree NP-complete problems Network flow Routing algorithms Graph Tree decomposition Bridge Tree Flow network Graph theory Mathematics Theoretical computer science
792	Streaming Lower Bounds for Approximating MAX-CUT Michael Kapralov∗ Sanjeev Khanna† Madhu Sudan‡ Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:51 Combinatorial optimization NP-complete problems Matroid theory Matching Graph coloring Cut Maximum cut Pseudoforest Minor Graph theory Mathematics Theoretical computer science
793	A Survey of Automated Timetabling A. Schaerf Dipartimento di Informatica e Sistemistica Universit` a di Roma “La Sapienza” Add to Reading List Source URL: www.diegm.uniud.it Language: English - Date: 2008-12-11 12:42:16 Mathematical optimization Operations research Search algorithms Complexity classes Combinatorial optimization Genetic algorithm Optimization problem Constraint satisfaction NP-complete Theoretical computer science Applied mathematics Computational complexity theory
794	Single Pass Spectral Sparsification in Dynamic Streams Michael Kapralov MIT Yin Tat Lee Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:51 Spanning tree NP-complete problems Algebraic graph theory Combinatorial optimization Matching Laplacian matrix Minimum spanning tree Connectivity Planar separator theorem Graph theory Mathematics Theoretical computer science
795	Parameterized Complexity for the Database Theorist Martin Grohe Division of Informatics, University of Edinburgh, Edinburgh EH9 3JZ, Scotland, UK. Email: 1 . Introduction Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2006-07-04 06:02:43 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Graph coloring Dominating set FO Time complexity Tree decomposition Theoretical computer science Computational complexity theory Applied mathematics
796	Su Doku the Number-Placing Puzzle 3 Add to Reading List Source URL: www.cleavebooks.co.uk Language: English - Date: 2007-05-13 18:37:34 Recreational mathematics Crossword Sudoku Matrix Sudoku algorithms Word search NP-complete problems Mathematics Logic puzzles
797	Tuning the Alt-Ergo SMT Solver for B Proof Obligations Sylvain Conchon1,2 and Mohamed Iguernelala3,1 1 2 Add to Reading List Source URL: bware.lri.fr Language: English - Date: 2014-09-27 11:09:54 Formal methods Logic in computer science Electronic design automation NP-complete problems Constraint programming Satisfiability Modulo Theories Automated theorem proving Solver Mathematical proof Theoretical computer science Mathematics Applied mathematics
798	July 25, 2007 Problem 1. Real numbers a1 , a2 , . . . , an are given. For each i (1 ≤ i ≤ n) define di = max{aj : 1 ≤ j ≤ i} − min{aj : i ≤ j ≤ n} and let d = max{di : 1 ≤ i ≤ n}. Add to Reading List Source URL: www.georgmohr.dk Language: English - Date: 2007-08-06 03:47:34 Graph operations Clique problem Graph theory Clique NP-complete problems
799	Multiplicative approximations of random walk transition probabilities Michael Kapralov∗ Rina Panigrahy† June 17, 2011 Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Connectivity Random walk NP-complete problems Algebraic graph theory Centrality Tutte polynomial Theoretical computer science Computational complexity theory Mathematics
800	Curriculum Vitae of Uriel Feige Contact Information Department of Computer Science and Applied Mathematics The Weizmann Institute of Science Rehovot 76100, ISRAEL Phones (office), (cell) Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2015-01-01 11:38:31 Computational complexity theory Complexity classes Approximation algorithm NP-complete ACM SIGACT European Symposium on Algorithms International Colloquium on Automata Languages and Programming Uriel Feige Algorithm Theoretical computer science Applied mathematics Computer science

UPDATE