External Links

    Journal: Theory Comput. Syst.

    Volume 41, Issue 2

    209 -- 210Maciej Liskiewicz, Rüdiger Reischuk. Preface
    211 -- 231Matthias P. Krieger. On the Incompressibility of Monotone DNFs
    233 -- 256Tomasz Jurdzinski, Krzysztof Lorys. Leftist Grammars and the Chomsky Hierarchy
    257 -- 289Daniel Meister. Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers
    291 -- 326Holger Spakowski, Rahul Tripathi. On the Power of Unambiguity in Alternating Machines
    327 -- 350Till Tantau. Logspace Optimization Problems and Their Approximability Properties
    351 -- 368Birgit Schelm. Average-Case Non-Approximability of Optimisation Problems
    369 -- 380Michael Brinkmeier. A Simple and Fast Min-Cut Algorithm
    381 -- 393Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch. Exact Algorithms for Graph Homomorphisms
    runs on