NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
981	EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-26 11:40:39 NP-complete problems Logic in computer science Electronic design automation Formal methods Automated theorem proving Boolean satisfiability problem Conjunctive normal form Search algorithm Unit propagation Theoretical computer science Applied mathematics Mathematics
982	Blocked Clause Elimination Matti J¨arvisalo1 , Armin Biere2 , and Marijn Heule 3 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-12-21 10:55:55 NP-complete problems Conjunctive normal form Automated theorem proving Boolean satisfiability problem Resolution Theoretical computer science Mathematics Applied mathematics
983	Symmetry in Gardens of Eden Christiaan Hartman Marijn J. H. Heule∗ Delft University of Technology Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 11:31:27 Boolean algebra Symmetry Logic in computer science NP-complete problems Electronic design automation Boolean satisfiability problem True quantified Boolean formula Conjunctive normal form Symmetry in mathematics Theoretical computer science Mathematics Applied mathematics
984	Dynamic Symmetry Breaking by Simulating Zykov Contraction Bas Schaafsma, Marijn Heule! and Hans van Maaren Department of Software Technology, Delft University of Technology [removed], [removed], h.van Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-04-21 07:17:46 Graph coloring NP-complete problems Complexity classes Boolean satisfiability problem SL 2-satisfiability Greedy coloring Theoretical computer science Graph theory Mathematics
985	PT-Scotch and libScotch 5.1 User’s Guide (version[removed]Fran¸cois Pellegrini Bacchus team, INRIA Bordeaux Sud-Ouest Add to Reading List Source URL: gforge.inria.fr Language: English NP-complete problems Shortest path problem Graph Tree Graph coloring Path decomposition Graph theory Theoretical computer science Mathematics
986	Scotch and libScotch 4.0 User’s Guide∗ Fran¸cois Pellegrini ScAlApplix project, INRIA Futurs ENSEIRB & LaBRI, UMR CNRS 5800 Universit´e Bordeaux I 351 cours de la Lib´eration, 33405 TALENCE, FRANCE Add to Reading List Source URL: www.labri.fr Language: English - Date: 2007-08-08 05:02:28 NP-complete problems Shortest path problem Tree Graph Graph theory Theoretical computer science Mathematics
987	Everything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask) Tom´ aˇs Balyo1 , Andreas Fr¨ohlich2 , Marijn J. H. Heule3 , Armin Biere2 ? Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 10:00:09 Automated theorem proving Logic in computer science Propositional calculus NP-complete problems Logic programming Boolean satisfiability problem Unit propagation Conjunctive normal form Resolution Theoretical computer science Mathematics Mathematical logic
988	Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads (PRELIMINARY VERSION; [removed]) ⋆ Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-25 04:19:32 Logic in computer science NP-complete problems Electronic design automation Formal methods Automated theorem proving Boolean satisfiability problem Satz Lookahead Solver Theoretical computer science Mathematics Applied mathematics
989	Improvement of the E ien y of Geneti Algorithms for S alable Parallel Graph Partitioning in a Multi-Level Framework Cédri Chevalier and François Pellegrini LaBRI and INRIA Futurs Add to Reading List Source URL: www.labri.fr Language: English - Date: 2006-05-21 08:07:32 NP-complete problems Applied mathematics Degree Topological graph theory Graph partition Theoretical computer science Mathematics Graph theory
990	Exact DFA Identification Using SAT Solvers Marijn J.H. Heule1, and Sicco Verwer2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:36:36 Automata theory NP-complete problems Graph coloring Graph theory Boolean satisfiability problem Deterministic finite automaton Clique DFA Records Powerset construction Theoretical computer science Mathematics Applied mathematics

UPDATE