Computability in Europe 2006
Logical Approaches to Computational Barriers

Print current page  Print this page

Special Session Talk:
Optimization and approximation problems related to polynomial system solving

Speaker: Klaus Meer
Presentation: swansea-2006.pdf

Abstract

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. 


websites: Arnold Beckmann 2006-04-20 Valid HTML 4.01! Valid CSS! eXTReMe Tracker hit counters by www.free-counters.net