NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
531	Gossiping in a Multi-Channel Radio Network An Oblivious Approach to Coping with Malicious Interference (Extended Abstract) Shlomi Dolev1 , Seth Gilbert2 , Rachid Guerraoui3 , and Calvin Newport4 1 Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2007-09-28 06:21:17 Analysis of algorithms NP-complete problems Adversary model Gossip protocol Clique Time complexity Algorithm Theoretical computer science Applied mathematics Computational complexity theory
532	The min-# problem, a hybrid error criterion for near-linear time performance Lilian Buzer∗† Abstract 2.1 Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:46 Network theory Shortest path problem NP-complete problems Connectivity Euclidean plane geometry Analysis of algorithms Path decomposition Minimum spanning tree Theoretical computer science Computational complexity theory Mathematics
533	Generation of Eﬃcient Algorithms for Maximum Marking Problems (和訳: 最大マーク付け問題の効率的解法の自動生成) Isao Sasano Add to Reading List Source URL: www.sic.shibaura-it.ac.jp Language: English - Date: 2014-02-04 09:21:05 Operations research Combinatorial optimization Mathematical optimization NP-complete problems Algorithm Mathematical logic Knapsack problem Optimization problem Genetic algorithm Applied mathematics Theoretical computer science Computational complexity theory
534	Solving the (𝒏𝟐 − 𝟏)-Puzzle in Real Time with 𝟖𝟑𝒏𝟑 Expected Moves Ian Parberry Technical Report LARCLaboratory for Recreational Computing Add to Reading List Source URL: larc.unt.edu Language: English - Date: 2014-04-08 15:10:35 Puzzles NP-complete problems Fads Fifteen puzzle Permutations Summation Sudoku algorithms Heuristic function Mathematics Mechanical puzzles Games
535	ANNALS OF PURE AND APPLIED LOGIC Annals of Pure and Applied Logic276 Fixed-parameter tractability and completeness IV: Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:20:30 Complexity classes NP-complete problems Structural complexity theory Mathematical optimization Parameterized complexity Dominating set P versus NP problem NP-complete Combinatory logic Theoretical computer science Computational complexity theory Applied mathematics
536	CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Network theory Shortest path problem Geodesic Travelling salesman problem Motion planning Trigonometric functions NP Curvature Theoretical computer science Mathematics Computational complexity theory
537	Growing Solver-Aided Languages with ROSETTE Emina Torlak & Rastislav Bodik U.C. Berkeley Add to Reading List Source URL: homes.cs.washington.edu Language: English - Date: 2014-08-13 19:27:03 Constraint programming Electronic design automation Formal methods Logic in computer science NP-complete problems Satisfiability Modulo Theories AMPL Theoretical computer science Applied mathematics Software engineering
538	Scheduling and SAT Emmanuel Hebrard Toulouse Outline Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2014-02-17 02:59:42 Constraint programming Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Satisfiability NP-complete Model checking Theoretical computer science Applied mathematics Computational complexity theory
539	A faster parameterized algorithm for set packing Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:58:37 NP-complete problems Combinatorics Analysis of algorithms Set packing Randomized algorithm Disjoint-set data structure Parameterized complexity Set cover problem Dominating set Theoretical computer science Computational complexity theory Mathematics
540	Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks George Kao∗ Thomas Fevens∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:53 Routing algorithms Wireless networking Routing protocols Network theory NP-complete problems Geographic routing Routing Unit disk graph Shortest path problem Graph theory Theoretical computer science Mathematics

UPDATE