Volume 41; Issue 2

Theory of Computing Systems

Volume 41; Issue 2
1

Exact Algorithms for Graph Homomorphisms

Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
Journal:
Theory of Computing Systems
Year:
2007
Language:
english
File:
PDF, 210 KB
english, 2007
2

A Simple and Fast Min-Cut Algorithm

Michael Brinkmeier
Journal:
Theory of Computing Systems
Year:
2007
Language:
english
File:
PDF, 488 KB
english, 2007
3

Logspace Optimization Problems and Their Approximability Properties

Till Tantau
Journal:
Theory of Computing Systems
Year:
2007
Language:
english
File:
PDF, 286 KB
english, 2007
4

Average-Case Non-Approximability of Optimisation Problems

Birgit Schelm
Journal:
Theory of Computing Systems
Year:
2007
Language:
english
File:
PDF, 265 KB
english, 2007
5

On the Incompressibility of Monotone DNFs

Matthias P. Krieger
Journal:
Theory of Computing Systems
Year:
2007
Language:
english
File:
PDF, 204 KB
english, 2007
6

On the Power of Unambiguity in Alternating Machines

Holger Spakowski, Rahul Tripathi
Journal:
Theory of Computing Systems
Year:
2007
Language:
english
File:
PDF, 543 KB
english, 2007
7

Leftist Grammars and the Chomsky Hierarchy

Tomasz Jurdzinski, Krzysztof Lorys
Journal:
Theory of Computing Systems
Year:
2007
Language:
english
File:
PDF, 256 KB
english, 2007
9

Preface

Maciej Liskiewicz and Rudiger Reischuk, Special Issue Editors
Journal:
Theory of Computing Systems
Year:
2007
Language:
english
File:
PDF, 90 KB
english, 2007