NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
361	Improved Bound for the Union of Fat Triangles∗ Esther Ezra† Boris Aronov‡ Abstract Add to Reading List Source URL: www.cims.nyu.edu Language: English - Date: 2010-10-14 21:45:02 Analysis of algorithms Computational geometry NP-complete problems Ε-net Time complexity Set cover problem Theoretical computer science Applied mathematics Computational complexity theory
362	Sage Reference Manual: Games Release 6.7 The Sage Development Team June 24, 2015 Add to Reading List Source URL: doc.sagemath.org Language: English - Date: 2015-06-24 05:21:38 Search algorithms Applied mathematics Recreational mathematics Puzzle video games Dancing Links Backtracking Exact cover Puzzle Sudoku algorithms Mathematics Sudoku NP-complete problems
363	LNCSCircle of Friend Query in Geo-Social Networks Add to Reading List Source URL: www.cse.unt.edu Language: English - Date: 2013-08-12 15:35:49 Search algorithms Approximation algorithms Mathematical optimization NP-complete problems Analysis of algorithms Nearest neighbor search Clique problem K-nearest neighbor algorithm Time complexity Theoretical computer science Mathematics Applied mathematics
364	Optimization of Cable Cycles: A Trade-off between Reliability and Cost Master Thesis in Micro-data Analysis Author: Barsam Payvar Add to Reading List Source URL: www.statistics.du.se Language: English - Date: 2014-04-22 07:57:30 NP-complete problems Travelling salesman problem Induced path Shortest path problem Graph Routing Combinatorial optimization Path Hamiltonian path Graph theory Theoretical computer science Mathematics
365	First-order reasoning in Yices2 Master Thesis in Computer Science Simon Cruanes∗ supervised by Bruno Dutertre †, Viktor Kuncak ‡, Benjamin Werner § SRI International, Menlo Park, CA September 2011 – March 2012 Add to Reading List Source URL: cedeela.fr Language: English - Date: 2013-02-07 03:54:46 Automated theorem proving Model theory Logic in computer science Constraint programming NP-complete problems Boolean satisfiability problem Satisfiability Modulo Theories DPLL algorithm Interpretation Theoretical computer science Logic Mathematical logic
366	Wedding Boolean Solvers with Superposition: a Societal Reform Simon Cruanes École polytechnique and INRIA, 23 Avenue d’Italie, 75013 Paris, France https://who.rocq.inria.fr/Simon.Cruanes/ Add to Reading List Source URL: cedeela.fr Language: English - Date: 2015-03-03 04:50:17 NP-complete problems Logic in computer science Boolean algebra Electronic design automation Formal methods Satisfiability Modulo Theories Boolean satisfiability problem Solver Boolean data type Theoretical computer science Applied mathematics Mathematics
367	Are you done with the crossword already? How about the sudoku? Ready for more puzzles? Want to exercise more than just your vocabulary and logic skills? Then listen up: starting tomorrow in this space, we’ll be introdu Add to Reading List Source URL: puzzle.berkeley.edu Language: English - Date: 2012-02-23 18:24:09 Logic puzzles Leisure Recreational mathematics Puzzles Crossword Sudoku Flavor text Kakuro The New York Times crossword puzzle NP-complete problems Games Mathematics
368	The Polyhedral Model Definitions Operations on Polyhedra Quantifier Elimination and SMT solvers Last Words Add to Reading List Source URL: labexcompilation.ens-lyon.fr Language: English - Date: 2013-05-14 05:12:13 Electronic design automation Formal methods Logic in computer science NP-complete problems Compiler optimizations Polyhedron Satisfiability Modulo Theories Boolean satisfiability problem Linear programming Theoretical computer science Mathematics Applied mathematics
369	Hitting Set Algorithms for Fast Data Recovery in the Face of Geographic Correlated Attacks Alon Efrat Esther Ezra Add to Reading List Source URL: www.cims.nyu.edu Language: English - Date: 2013-07-29 14:22:26 Computational geometry Ε-net Connectivity NP Erasure code Planar graph NP-complete problems Dominating set Tutte polynomial Graph theory Theoretical computer science Mathematics
370	BRICS Basic Research in Computer Science BRICS RS-01-6 Gutin et al.: Domination Analysis of Greedy-Type Heuristics for the TSP Add to Reading List Source URL: www.brics.dk Language: English - Date: 2001-02-27 07:23:57 Operations research NP-complete problems Nearest neighbour algorithm Integer sequences Greedy algorithm Domination analysis Factorial Heuristic function Summation Mathematics Approximation algorithms Travelling salesman problem

UPDATE