Sage Reference Manual: Numerical Optimization Release 6.7 The Sage Development Team

First Page		Document Content
Date: 2015-06-24 05:21:38 Operations research Dynamic programming Cryptography Combinatorial optimization Knapsack problem Subset sum problem Sequence Exponentiation Linear programming Mathematics Theoretical computer science Computational complexity theory		Sage Reference Manual: Numerical Optimization Release 6.7 The Sage Development Team Add to Reading List Source URL: doc.sagemath.org Download Document from Source Website File Size: 598,79 KB Share Document on Facebook

	An FPTAS for the Subset Sum Problem Margarida Mamede, DI – FCT/UNL DocID: 1sYqA - View Document
	The Subset Sum Problem Reducing Time Complexity of NP-Completeness with Quantum Search Abstract The Subset Sum Problem is a member of the NPcomplete class, so no known polynomial time algorithm exists for it. Although th DocID: 1skX8 - View Document
	Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA DocID: 1qWOd - View Document
	Hans Kellerer, Ulrich Pferschy, David Pisinger Knapsack Problems Springer’s internal project number, if known Mathematics – Monograph (English) DocID: 1oxHC - View Document
	Quantum algorithms for the subset-sum problem D. J. Bernstein University of Illinois at Chicago & Technische Universiteit Eindhoven Joint work with: DocID: 1ltaX - View Document