Journal: Theory Comput. Syst.

Volume 43, Issue 2

99 -- 0Sergei N. Artëmov, Volker Diekert, Dima Grigoriev. Foreword
100 -- 117Vikraman Arvind, Bireswar Das. SZK Proofs for Black-Box Group Problems
118 -- 135Olaf Beyersdorff. Tuples of Disjoint NP-Sets
136 -- 158Manuel Bodirsky, Jan Kára. The Complexity of Equality Constraint Languages
159 -- 184Anna Gál, Michal Koucký, Pierre McKenzie. Incremental Branching Programs
185 -- 203Evan Goris. Feasible Operations on Proofs: The Logic of Proofs for Bounded Arithmetic
204 -- 233Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Gábor Rudolf, Jihui Zhao. On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
234 -- 253Daniel Mölle, Stefan Richter, Peter Rossmanith. Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
254 -- 271Vladimir V. Rybakov. Branching Time Logics ::::BTL:::::::U, S:::::N, N:::-1:::::(::::Z::::)::a:: with Operations ::::Until:::: and ::::Since:::: Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms
272 -- 293Tatiana Yavorskaya. Interacting Explicit Evidence Systems