External Links

    Journal: Theory Comput. Syst.

    Volume 55, Issue 2

    279 -- 280Nikolay K. Vereshchagin. Editorial
    281 -- 298Scott Aaronson. The Equivalence of Sampling and Searching
    299 -- 312Daniil Musatov. Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
    313 -- 329Andrei E. Romashchenko. Pseudo-Random Graphs and Bit Probe Schemes with One-Sided Error
    330 -- 346Klaus Meer. An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents
    347 -- 379Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios. Join-Reachability Problems in Directed Graphs
    380 -- 403Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen. The Complexity of Solving Reachability Games Using Value and Strategy Iteration
    404 -- 420Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien. Learning Read-Constant Polynomials of Constant Degree Modulo Composites
    421 -- 447Christos A. Kapoutsis. Two-Way Automata Versus Logarithmic Space
    runs on