First Page | Document Content | |
---|---|---|
Date: 2011-08-31 08:22:53NP-complete problems Combinatorial optimization Cryptography Knapsack problem Operations research Theoretical computer science Applied mathematics Dynamic programming | Improved Generic Algorithms for Hard Knapsacks? Anja Becker1,?? , Jean-S´ebastien Coron3 , and Antoine Joux1,2 1 University of Versailles Saint-Quentin-en-Yvelines 2Add to Reading ListSource URL: eprint.iacr.orgDownload Document from Source WebsiteFile Size: 465,93 KBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |