Knapsack - PDFSEARCH.IO - Document Search Engine

Knapsack
Results: 173

#	Item
141	EVERYTHING YOU NEED TO KNOW ABOUT FILL YOUR KNAPSACK WITH: • Lunch Add to Reading List Source URL: highpointcamp.com Language: English - Date: 2014-06-23 23:22:24 Cookie Desserts Peanut Snickers Camping Almond Planters Food and drink Snack foods Candy bars
142	A Comment on \A New Public{Key Cipher System Based Upon the Diophantine Equations" S.R. Blackburn, S. Murphyyand K.G. Patersonz Information Security Group, Royal Holloway, University of London, Surrey TW20 0EX, U.K. Add to Reading List Source URL: www.isg.rhul.ac.uk Language: English - Date: 2005-11-30 04:39:34 Modular arithmetic Public-key cryptography Euclidean algorithm Merkle–Hellman knapsack cryptosystem Linear congruence theorem Quadratic residue Affine cipher Classical cipher Cryptography Mathematics Number theory
143	Permuted Function Matching Rapha¨el Clifforda , Benjamin Sach∗,a a Department of Computer Science, University of Bristol,UK Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:18 Combinatorial optimization Dynamic programming Combinatorics Operations research Knapsack problem Matching Permutation Pattern matching Time complexity Theoretical computer science Computational complexity theory Applied mathematics
144	Supervised Clustering Based on DPClusO: Prediction of Plant-Disease Relations Using Jamu Formulas of KNApSAcK Database Add to Reading List Source URL: www.ncbi.nlm.nih.gov Language: English Indonesian culture Jamu Education in the Czech Republic Cluster analysis Janáček Academy of Music and Performing Arts Statistics Traditional medicine Health in Indonesia
145	15-854: Approximations Algorithms Topic: Dynamic Programming Scribe: Mihir Kedia Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2005-10-28 08:20:42 Complexity classes Mathematical optimization Operations research NP-complete problems Strongly NP-complete Polynomial-time approximation scheme Job shop scheduling Knapsack problem Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
146	Part II Approximation Algorithms Add to Reading List Source URL: www2.informatik.hu-berlin.de Language: English - Date: 2011-02-08 14:10:43 Operations research Mathematical optimization Combinatorial optimization NP-complete problems Knapsack problem Polynomial-time approximation scheme Dynamic programming Approximation algorithm Algorithm Theoretical computer science Computational complexity theory Applied mathematics
147	CS 598CSC: Approximation Algorithms Instructor: Chandra Chekuri Add to Reading List Source URL: courses.engr.illinois.edu Language: English - Date: 2009-02-06 16:43:24 Operations research NP-complete problems Combinatorial optimization Dynamic programming Knapsack problem Bin packing problem Polynomial-time approximation scheme Approximation algorithm Linear programming relaxation Theoretical computer science Computational complexity theory Applied mathematics
148	Coping With NP-Hardness Approximation Algorithms Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2001-05-07 12:05:44 Operations research NP-complete problems Combinatorial optimization Approximation algorithms Travelling salesman problem Christofides algorithm Polynomial-time approximation scheme Optimization problem Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics
149	LNCS[removed]Public-Key Cryptosystems Based on Composite Degree Residuosity Classes Add to Reading List Source URL: www.liammorris.com Language: English - Date: 2013-04-30 09:09:49 Decisional composite residuosity assumption Rabin cryptosystem Goldwasser–Micali cryptosystem RSA Probabilistic encryption Quadratic residue Merkle–Hellman knapsack cryptosystem Homomorphic encryption Semantic security Cryptography Public-key cryptography Paillier cryptosystem

UPDATE