PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

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.


We outline some current work in real number complexity theory with a focus on own results. The topics discussed are all located in the area of polynomial system solving. First, we concentrate on a combinatorial optimization problem related to homotopy methods for solving numerically generic polynomial systems. Then, approximation problems are discussed in relation with Probabilistically Checkable Proofs over the real numbers.

Postscript - Requires a viewer, such as GhostView
EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:2101
Deposited By:Klaus Meer
Deposited On:04 May 2006