NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
31	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti Add to Reading List Source URL: www.crypto.ethz.ch Language: English - Date: 2015-04-20 05:14:26 Cryptography Graph theory Mathematics NP-complete problems Zero-knowledge proof Algebraic graph theory Commitment scheme Hamiltonian path problem Hamiltonian path Proof of knowledge Adjacency matrix NP
32	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:33 Graph theory Mathematics Computational complexity theory NP-hard problems NP-complete problems Edsger W. Dijkstra Combinatorial optimization Approximation algorithms Travelling salesman problem Shortest path problem Matching Randomized algorithm
33	arXiv:1110.4319v2 [cs.DS] 20 Oct 2011 Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-10-20 20:42:54 Graph theory Computational complexity theory Mathematics NP-complete problems Graph connectivity Combinatorial optimization Cut Approximation algorithm Randomized algorithm Independent set Semidefinite programming Randomized rounding
34	Item in the Media by Ucaoimhu N A certain periodical recently used an offbeat four-word phrase to refer to an item O Add to Reading List Source URL: www.math.uchicago.edu Language: English - Date: 2006-07-22 11:54:03 NP-complete problems Leisure Logic puzzles Crossword Puzzles
35	Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2011-04-27 05:26:37 Graph theory Mathematics NP-complete problems Graph coloring Matching Bipartite graph Color-coding Treewidth Graph Cycle Line graph Chromatic polynomial
36	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-03-26 07:24:20 Graph theory Computational complexity theory Mathematics NP-complete problems Vertex cover Steiner tree problem Shortest path problem Linear programming Edge disjoint shortest pair algorithm Minimum bottleneck spanning tree
37	New Mexico Military Institute Medical Packet - Marshall Infirmary Incoming Cadets and Parents: 1. Please complete the attached Medical Information, Medical History, and Insurance forms, and ask your physician (NP, PA, MD Add to Reading List Source URL: www.nmmi.edu Language: English - Date: 2016-01-28 14:43:29 Medicine Clinical medicine Vaccines RTT Health Vaccination Tetanus Pertussis DPT vaccine Immunization Influenza vaccine Booster dose
38	Finding Common Structured Patterns in Linear Graphs ? Guillaume Fertin LINA, CNRS UMR 6241, Universit´e de Nantes, 2 rue de la Houssini`ere, 44322 Nantes, France Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2011-04-27 05:27:10 Graph theory Graph coloring NP-complete problems Matroid theory Graph Matching Ear decomposition Pathwidth Independent set
39	On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: + Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:02 Graph theory Mathematics Computational complexity theory NP-complete problems Spanning tree Combinatorial optimization Maximal independent set Matching Connectivity Vertex cover Minimum spanning tree Leader election
40	Moment methods in extremal geometry David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin) 51st Dutch Mathematical Congress Add to Reading List Source URL: www.daviddelaat.nl Language: English Mathematics Geometry Discrete geometry NP-complete problems Circle packing Conjectures Operations research Sphere packing Independent set Tammes problem Kepler conjecture Semidefinite programming

UPDATE