External Links

    Journal: Computational Complexity

    Volume 12, Issue 3-4

    85 -- 130Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma. Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
    131 -- 149Andreas Bley. On the complexity of vertex-disjoint length-restricted path problems
    150 -- 161Qi Cheng. Straight-line programs and torsion points on elliptic curves
    162 -- 175Takashi Mihara, Shao Chin Sung. Deterministic polynomial-time quantum algorithms for Simon s problem

    Volume 12, Issue 1-2

    1 -- 22Ronen Shaltiel. Towards proving strong direct product theorems
    23 -- 47Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski. Complexity of some arithmetic problems for binary polynomials
    48 -- 84John Watrous. On the complexity of simulating space-bounded quantum computations
    runs on