.np - PDFSEARCH.IO - Document Search Engine

.np
Results: 11236

#	Item
701	LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction Add to Reading List Source URL: www.cs.tau.ac.il Language: English - Date: 2009-01-01 08:42:54 Computational complexity theory Graph theory Mathematics Phylogenetics NP-complete problems Computational phylogenetics Analysis of algorithms Probabilistic complexity theory Randomized algorithm Steiner tree problem Algorithm Maximum parsimony
702	Mathematics for Computer Science Eric Lehman and Tom Leighton 2004 2 Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2006-08-23 14:28:28 Mathematics Graph theory Discrete mathematics NP-complete problems Graph coloring Algebra Recurrence relation Theory of computation Number theory Algorithm Independent set Mathematical induction
703	VERTEX PERFECT GRAPHS By Riley Littlefield A SENIOR RESEARCH PAPER PRESENTED TO THE DEPARTMENT OF Add to Reading List Source URL: www2.stetson.edu Language: English - Date: 2015-04-24 19:11:58 Graph theory Graph operations Graph coloring NP-complete problems Graph Vertex Cycle Degree Ear decomposition Edge contraction Perfect graph Tree
704	New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2013-03-14 00:55:15 Graph theory Graph operations NP-complete problems Bipartite graphs Combinatorial optimization Matching Line graph Chordal graph Clique Complete bipartite graph Independent set Cograph
705	Scalable Flow-Based Community Detection for Large-Scale Network Analysis Seung-Hee Bae∗ , Daniel Halperin∗ , Jevin West† , Martin Rosvall‡ and Bill Howe∗ ∗ Department of Computer Science and Engineering, Uni Add to Reading List Source URL: www.jevinwest.org Language: English - Date: 2015-11-11 00:05:03 Mathematics Computational complexity theory NP-complete problems Algorithm Mathematical logic Theoretical computer science Graph partition Community structure Connectivity
706	PDF Document Add to Reading List Source URL: election.gov.np - Date: 2016-08-04 06:44:55
707	1. Austin, We Have Two Problems by Ucaoimhu A certain well-known figure was, fortunately, well trained to deal with certain problems as they arose. Specifically: (1) For thirteen Down clues, the string of letters produce Add to Reading List Source URL: www.math.uchicago.edu Language: English - Date: 2013-07-05 20:53:08 Cluedo Gaming NP-complete problems Mind
708	PDF Document Add to Reading List Source URL: www.lmtc.gov.np Language: Nepali - Date: 2016-07-03 03:21:32
709	An Eﬃcient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grant Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2012-05-30 08:53:38 Computational complexity theory Cryptography Theory of computation Probabilistic complexity theory IP Zero-knowledge proof Soundness PP Entropy NP Randomized algorithm Interactive proof system
710	A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2004-09-21 15:30:36 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization Edsger W. Dijkstra Spanning tree Operations research Shortest path problem Graph Linear programming Steiner tree problem

UPDATE