Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1

First Page		Document Content
Date: 2013-11-01 17:11:52 Mathematics Computational complexity theory Algebra NP-complete problems Analysis of algorithms Set cover problem Bin packing problem Linear programming relaxation Vertex cover Ring Exponentiation Big O notation		Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1 Add to Reading List Source URL: www.math.washington.edu Download Document from Source Website File Size: 459,36 KB Share Document on Facebook

	Stealing Keys from PCs by Radio: Cheap Electromagnetic Attacks on Windowed Exponentiation (extended version) Daniel Genkin Lev Pachmanov DocID: 1xW2E - View Document
	Appears in P. J. Lee, C. H. Lim (Eds.): Information Security and Cryptology – ICISC 2002, Springer-Verlag LNCS 2587, pp. 298–312, ISBN, 2003. Improved Techniques for Fast Exponentiation Bodo M¨oller Te DocID: 1vkME - View Document
	Cryptology ePrint Archive, Report, http://eprint.iacr.org/ Faster Multi-Exponentiation through Caching: Accelerating (EC)DSA Signature Verification Bodo M¨oller and Andy Rupp DocID: 1vkLm - View Document
	Stealing Keys from PCs by Radio: Cheap Electromagnetic Attacks on Windowed Exponentiation (extended version) Daniel Genkin Lev Pachmanov DocID: 1tEtV - View Document
	EXPONENTIATION WITH ARBITRARY BASES, EXPONENTS MATH 152, SECTION 55 (VIPUL NAIK) Corresponding material in the book: Section 7.5. What students should definitely get: The definition of ab , where a > 0 and b is real. The DocID: 1sa3i - View Document