1. Complexity and Approximability of the Cover Polynomial

   • Markus Bläser
   • Holger Dell
   • Mahmoud Fouz

   OriginalPaper 04 August 2011 Pages: 359 - 419

2. On reducing factorization to the discrete logarithm problem modulo a composite

   • Jacek Pomykała
   • Bartosz Źrałek

   OriginalPaper 08 February 2012 Pages: 421 - 429

3. On a Theorem of Razborov

   • Henning Wunderlich

   OriginalPaper 21 October 2011 Pages: 431 - 477

4. Low-Depth Witnesses are Easy to Find

   • Luís Antunes
   • Lance Fortnow
   • André Souto

   OriginalPaper 10 November 2011 Pages: 479 - 497

5. A Quantum Characterization Of NP

   • Hugue Blier
   • Alain Tapp

   OriginalPaper 19 October 2011 Pages: 499 - 510

6. Length 3 Edge-Disjoint Paths Is NP-Hard

   • Hannah Alpert
   • Jennifer Iglesias

   OriginalPaper 21 March 2012 Pages: 511 - 513