NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
991	Clause Elimination Procedures for CNF Formulas Marijn Heule1 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Department of Software Technology, Delft University of Technology, The Netherlands Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:34:30 Automated theorem proving Mathematical logic Propositional calculus Logic in computer science NP-complete problems Conjunctive normal form Resolution Boolean satisfiability problem Unit propagation Theoretical computer science Logic Mathematics
992	To appear in 13th International Conference on Computer Vision, 6-13 November 2011, Barcelona, Spain. Image Segmentation by Figure-Ground Composition into Maximal Cliques Adrian Ion∗, Joao Carreira, Cristian Sminchises Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2014-06-04 23:25:00 Applied mathematics Image processing Segmentation Geometry Tessellation Market segmentation Clique problem Clique Independent set Mathematics Tiling NP-complete problems
993	Revisiting Hyper Binary Resolution Marijn J.H. Heule1,3 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Department of Computer Science, The University of Texas at Austin, United States Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 14:06:39 Automated theorem proving Logic in computer science NP-complete problems Conjunctive normal form Resolution Unit propagation Boolean satisfiability problem Literal Transitivity Theoretical computer science Mathematical logic Mathematics
994	Covered Clause Elimination Marijn Heule∗ TU Delft, The Netherlands Matti J¨arvisalo† Univ. Helsinki, Finland Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:30:47 Automated theorem proving Logic in computer science NP-complete problems Logic programming Conjunctive normal form Boolean satisfiability problem Unit propagation Resolution Clause Theoretical computer science Mathematical logic Mathematics
995	DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs Nathan Wetzler, Marijn J. H. Heule, and Warren A. Hunt, Jr. ? Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-04-02 18:01:43 Automated theorem proving Formal methods NP-complete problems Constraint programming Logic in computer science True quantified Boolean formula Resolution Satisfiability Modulo Theories Unsatisfiable core Theoretical computer science Mathematics Logic
996	Blocked Clause Elimination and its Extensions Marijn J. H. Heule∗ joint work with Matti J¨arvisalo and Armin Biere Abstract Boolean satisfiability (SAT) has become a core technology in many application Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 08:16:51 NP-complete problems Conjunctive normal form Automated theorem proving Boolean satisfiability problem Resolution Logic programming 2-satisfiability Theoretical computer science Mathematics Applied mathematics
997	Sage Reference Manual: Games Release 6.6.beta0 The Sage Development Team February 21, 2015 Add to Reading List Source URL: sagemath.org Language: English - Date: 2015-02-21 07:35:21 Search algorithms Applied mathematics Recreational mathematics Puzzle video games Dancing Links Backtracking Exact cover Puzzle Sudoku algorithms Mathematics Sudoku NP-complete problems
998	Scotch and libScotch 5.1 User’s Guide (version[removed]Fran¸cois Pellegrini Bacchus team, INRIA Bordeaux Sud-Ouest IPB & LaBRI, UMR CNRS 5800 Add to Reading List Source URL: gforge.inria.fr Language: English NP-complete problems Scotch Shortest path problem Graph partition Algorithm Nested dissection Graph Mathematics Theoretical computer science Graph theory
999	Using a satisfiability solver to identify deterministic finite state automata Marijn J.H. Heule Sicco Verwer Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-08-19 05:30:10 NP-complete problems Complexity classes Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation Graph coloring SL NP-complete Theoretical computer science Mathematics Computational complexity theory
1000	will the next generation act? mathematics and policy need to meet in preschool Where the language of mathematics cannot be heard, neither can reason. Yet mathematics remains culturally unintegrated while the future depe Add to Reading List Source URL: files.howtolivewiki.com Language: English - Date: 2014-04-16 02:48:14 Recreational mathematics Puzzles Mechanical puzzles Combination puzzles NP-complete problems Mathematical game Lego Martin Gardner Toy Games Mathematics Digital media

UPDATE