NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
681	Combining Component Caching and Clause Learning for Effective Model Counting Tian Sang1 , Fahiem Bacchus2 , Paul Beame1 , Henry Kautz 1 , and Toniann Pitassi 2 1 Computer Science and Engineering, University of Washingto Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2004-04-13 00:26:28 NP-complete problems Automated theorem proving Constraint programming Boolean algebra Formal methods DPLL algorithm Boolean satisfiability problem Conjunctive normal form Lookup table Theoretical computer science Applied mathematics Mathematics
682	Semi-local string comparison Alexander Tiskin http://www.dcs.warwick.ac.uk/~tiskin Department of Computer Science University of Warwick Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2006-07-07 01:33:40 String Combinatorics NP-complete problems Formal languages Substring Longest common subsequence problem Subsequence Approximate string matching String searching algorithm Mathematics Dynamic programming Theoretical computer science
683	18 PUZZLES TUESDAY JANUARYHOROSCOPES Add to Reading List Source URL: www.territorystories.nt.gov.au Language: English - Date: 2015-03-04 17:41:34 Logic puzzles Games Cryptic crossword Sudoku Human behavior Word square Classical cipher NP-complete problems Crosswords Leisure
684	Discrete Comput Geom: 701–722 DOIs00454z Minimum Manhattan Network is NP-Complete Francis Y.L. Chin · Zeyu Guo · He Sun Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2011-05-04 06:25:07 Microsoft Gadgets Computing Computational complexity theory Gadget Struct
685	PUZZLES 13 THURSDAY JANUARYHOROSCOPES Add to Reading List Source URL: www.territorystories.nt.gov.au Language: English - Date: 2015-03-15 20:38:53 Leisure Games Logic puzzles Cryptic crossword Sudoku Word square Classical cipher NP-complete problems Crosswords Mathematics
686	Interval Scheduling and Colorful Independent Sets Ren´e van Bevern1,∗ , Matthias Mnich2 , Rolf Niedermeier1 , and Mathias Weller1,† 1 Institut f¨ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-11-07 08:24:33 Clique Interval graph Independent set Claw-free graph Matching Cograph Path decomposition Maximal independent set Graph theory NP-complete problems Graph operations
687	Journal of Artificial Intelligence Research446 Submitted 12/13; published 6/14 A Multivariate Complexity Analysis of Lobbying in Multiple Referenda Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-06-16 17:55:22 Complexity classes NP-complete problems Analysis of algorithms Mathematical optimization Parameterized complexity NP-hard Kernelization NP P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
688	Approximation Algorithms Recap Advanced Algorithms – COMS31900 A polynomial time algorithm A is an α-approximation for problem P if, it always outputs a solution s with Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes NP-complete problems Bin packing problem Approximation algorithms Discrete geometry Packing problem Polynomial-time approximation scheme Time complexity Bin Theoretical computer science Computational complexity theory Applied mathematics
689	Better bounds for matchings in the streaming model Michael Kapralov∗ July 26, 2012 Abstract In this paper we present improved bounds for approximating maximum matchings in bipartite graphs in Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 NP-complete problems Combinatorial optimization Matching Degree Maximum flow problem Graph coloring Dominating set Mathematics Graph theory Theoretical computer science
690	Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if, Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 NP-complete problems Operations research Bin packing problem Approximation algorithm Job shop scheduling Greedy algorithm Algorithm Theoretical computer science Mathematics Applied mathematics

UPDATE