1. Uniform hardness versus randomness tradeoffs for Arthur-Merlin games

   • Dan Gutfreund
   • Ronen Shaltiel
   • Amnon Ta-Shma

   Original Article Pages: 85 - 130

2. On the complexity of vertex-disjoint length-restricted path problems

   • Andreas Bley

   Original Article Pages: 131 - 149

3. Straight-line programs and torsion points on elliptic curves

   • Qi Cheng

   Original Article Pages: 150 - 161

4. Deterministic polynomial-time quantum algorithms for Simon’s problem

   • Takashi Mihara
   • Shao Chin Sung

   Original Article Pages: 162 - 175