.np - PDFSEARCH.IO - Document Search Engine

.np
Results: 11236

#	Item
651	PDF Document Add to Reading List Source URL: swbbl.com.np - Date: 2016-06-24 02:54:24
652	Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995 Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2001-10-24 10:55:38 Cryptography Polynomials Probabilistic complexity theory IP Commitment scheme NP Interactive proof system Zero-knowledge proof Polynomial interpolation Polynomial Random self-reducibility Permutation polynomial
653	Specral Graph Theory and its Applications September 2, 2004 Lecture 1 Lecturer: Daniel A. Spielman Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2005-06-30 12:02:42 Graph theory Mathematics Algebra Algebraic graph theory Matrices NP-complete problems Eigenvalues and eigenvectors Linear algebra Regular graph Planar graph Laplacian matrix Adjacency matrix
654	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
655	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
656	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
657	Mining Relations from Git Commit Messages — an Experience Report Rikard Andersson∗ , Morgan Ericsson†∗ , Anna Wingkvist† ∗ Chalmers \| University of Gothenburg Gothenburg, Sweden Add to Reading List Source URL: www2.lingfil.uu.se Language: English - Date: 2014-10-16 02:36:21 Linguistics Language Cognitive science Computational linguistics Natural language processing Named-entity recognition Relex Information extraction Statistical classification P versus NP problem Part-of-speech tagging Syntax
658	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
659	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
660	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

UPDATE