Volume 41, Number 1, July 2007
: Optimal Semicomputable Approximations to Reachable and Invariant Sets.
: Shrad: A Language for Sequential Real Number Computation.
: Some Relations between Approximation Problems and PCPs over the Real Numbers.
: Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory.
: Computable Analysis of a Boundary-Value Problem for the Korteweg-de Vries Equation.
Volume 41, Number 2, August 2007
: Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers.
: Logspace Optimization Problems and Their Approximability Properties.
: Average-Case Non-Approximability of Optimisation Problems.
Volume 41, Number 3, October 2007
Faisal N. Abu-Khzam
: Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems.
Volume 41, Number 4, December 2007
: Formal Efficiency Analysis for Tree Transducer Composition.
, Grzegorz Malewicz
: Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably.