Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA - James Morehead - Document - PDFSEARCH.IO - Document Search Engine

<--- Back to Details

First Page		Document Content
Date: 2014-04-18 04:16:48 Mathematics Search algorithms Information retrieval Information science Hashing Analysis of algorithms Cryptographic hash functions Computational complexity theory Universal hashing Hash function Randomized algorithm Subset sum problem		Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA Add to Reading List Source URL: web.stanford.edu Download Document from Source Website File Size: 400,68 KB Share Document on Facebook

Similar Documents

	MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity Martin Albrecht1 , Lorenzo Grassi3 , Christian Rechberger2,3 , Arnab Roy2 , and Tyge Tiessen2 1 DocID: 1xUN2 - View Document
	Introduction to Locality-Sensitive Hashing Tyler NeylonFormats: html \| pdf \| kindle pdf] Locality-sensitive hashing (LSH) is a set of techniques that DocID: 1xTR9 - View Document
	Proceedings: Equality and Hashing for (Almost) Free: Generating Implementations from Abstraction Functions DocID: 1xTdH - View Document