NP - PDFSEARCH.IO - Document Search Engine

NP
Results: 11236

#	Item
751	PDF Document Add to Reading List Source URL: ppmo.gov.np - Date: 2016-05-12 06:24:15
752	nf]s ;]jf cfof]u s]Gb\|Lo sfof{no, cgfdgu/ ;"rgf tyf k\|sfzg zfvf cf=j= @)&#÷&$ sf] kbk"lt{ ;DaGwL jflif{s sfo{tflnsf –! Add to Reading List Source URL: www.psc.gov.np Language: Danish - Date: 2016-07-17 01:40:55
753	Vijaya Laghu Bittiya_ Vacancy.FH11 Add to Reading List Source URL: www.vlbs.com.np - Date: 2015-08-06 08:59:22
754	Falso: a simple, self-consistent logic Antoine Amarilli Club Inutile & Estatis, Inc. Scholarly Outreach Division 1 Accounting Dr., Mariana Trench, Intl. Waters Add to Reading List Source URL: www.ben-sherman.net Language: English - Date: 2016-08-02 11:41:55 Logic Mathematical logic Mathematics Automated theorem proving Model theory Proof theory Complexity classes Logical connectives NP IP Negation Coq
755	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
756	3rd Draft Consolidated MER 10 June 2011 Add to Reading List Source URL: www.nrb.org.np Language: English - Date: 2011-12-07 05:22:21 Financial crimes Law Economy Terrorism Financial regulation Tax evasion Money laundering Asia/Pacific Group on Money Laundering Beneficial ownership Financial Action Task Force on Money Laundering Terrorism financing Financial intelligence
757	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
758	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
759	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
760	One of Those Constructions that Really Needs a Proper Analysis Doug Arnold & Christopher Lucas University of Essex SOAS, University of London Add to Reading List Source URL: nlp.ipipan.waw.pl Language: English - Date: 2016-05-21 18:56:48 Linguistics Syntax Cognitive science Partitive Relative clause Grammatical number Clause Extraposition English relative clauses Ivan Sag NP Plural

UPDATE