PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

EPrints submitted by Klaus Meer

Click here to see user's record.

Number of EPrints submitted by this user: 11

Complexity analysis of a semi-infinite optimization problem in interval arithmetic
Klaus Meer
Preprint 2004.

Transparent long proofs: A first PCP theorem for $\mbox{NP}_{\R}$
Klaus Meer
Preprint 2004.

Optimization Theory
Hubertus Th. Jongen, Klaus Meer and Eberhard Triesch
(2004) Kluwer Academic Publishers , Boston, USA . ISBN 1402080999

Transparent long proofs: A first PCP theorem for $\mbox{NP}_{\R}$
Klaus Meer
In: 31st International Colloquium ICALP 2004, 12 July - 16 July 2004, Turku, Finland.

On some relations between approximation problems and PCPs over the real numbers
Klaus Meer
Theory of Computing Systems 2005.

Computing Minimal Multi-Homogeneous B\'ezout Numbers is Hard
Klaus Meer and Gregorio Malajovich
Theory of Computing Systems 2005.

On some relations between approximation problems and PCPs over the real numbers
Klaus Meer
Theory of Computing Systems 2005.

Optimization and approximation problems related to polynomial system solving
Klaus Meer
In: Computability in Europe 2006 : Logical Approaches to Computational Barriers, 30 June - 05 July 2006, Swansea.

Approximation classes for real number optimization problems
Klaus Meer and Uffe Flarup
In: 5th International Conference on Unconventional Computation,, 4-8 Sep 2006, York, UK.

Two logical hierarchies of optimization problems over the real numbers
Klaus Meer and Uffe Flarup
Mathematical Logic Quarterly Volume 52, Number 1, pp. 37-50, 2006.

On the OBDD Size for Graphs of Bounded Tree- and Clique-Width
Klaus Meer and Dieter Rautenbach
In: The 2nd International Workshop on Parameterized and Exact Computation, 13-15 Sep 2006, Zuerich, Switzerland.