NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
81	Noname manuscript No. (will be inserted by the editor) A portable parallel implementation of the lrs vertex enumeration code David Avis and Gary Roumanis Add to Reading List Source URL: cgm.cs.mcgill.ca Language: English - Date: 2013-11-01 11:17:39 Computer programming Mathematics Software engineering Graph connectivity Connectivity Tree traversal Search algorithms NP-complete problems Biconnected component HopcroftKarp algorithm
82	Introduction & Motivation Relations and Operations Boolean and 3-element cases Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-08-14 00:50:42 Computational complexity theory Complexity classes Theory of computation FO PSPACE SO P EXPTIME Boolean algebra Co-NP-complete Reduction Descriptive complexity theory
83	The giant component in a random subgraph of a given graph Fan Chung1 ? , Paul Horn1 , and Linyuan Lu2 1 ?? Add to Reading List Source URL: web.cs.du.edu Language: English - Date: 2010-11-16 11:14:05 Graph theory Mathematics Algebraic graph theory Matrices Adjacency matrix Regular graph Graph coloring NP-complete problems Two-graph Expander graph
84	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:46:12 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization NP-hard problems Approximation algorithms Edsger W. Dijkstra Travelling salesman problem Nearest neighbour algorithm Shortest path problem Maximal independent set
85	Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1 Max-Planck-Institut f¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:52 Mathematics Computational complexity theory Graph theory Analysis of algorithms NP-complete problems Probabilistic complexity theory Combinatorics Randomized algorithm Rejection sampling NP Independent set Poisson distribution
86	PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡ Add to Reading List Source URL: users.eecs.northwestern.edu Language: English - Date: 2009-09-15 22:21:32 Computational complexity theory Mathematics Theory of computation NP-complete problems Operations research Approximation algorithms Combinatorial optimization Set cover problem Linear programming relaxation Greedy algorithm Facility location problem Reduction
87	Cryptographic Protocols Spring 2015 Slides for Chapter 1 (6th lecture) Hamiltonian cycles Add to Reading List Source URL: www.crypto.ethz.ch Language: English - Date: 2015-03-30 06:00:41 Graph theory NP-complete problems Hamiltonian path Cycle Hamiltonian Zero-knowledge proof Hamiltonian path problem
88	Microsoft PowerPoint - Presentation2 Add to Reading List Source URL: web.cse.ohio-state.edu Language: English - Date: 2009-01-27 18:47:33 Graph theory Mathematics Graph connectivity Network theory NP-complete problems Edsger W. Dijkstra Shortest path problem Graph Path Hamiltonian path Distance Biconnected component
89	Increasing the Minimum Degree of a Graph by Contractions? Petr A. Golovach1 , Marcin Kami´ nski2 , Dani¨el Paulusma1 , and Dimitrios M. Thilikos3 1 Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2011-07-20 16:50:25 Graph theory Mathematics NP-complete problems Graph operations Graph coloring Graph Edge contraction Longest path problem Vertex Cycle Line graph Vertex cover
90	PDF Document Add to Reading List Source URL: terrystickels.com Language: English - Date: 2011-02-16 00:18:50 NP-complete problems Sudoku Terry Stickels Piracy Crime Misconduct Gaming Pazurgo

UPDATE