index - IFIP WG1.1 : Continous Algorithms and Complexity

IFIP - TC1 : Foundations of Computer Science

WG 1.1 : Continuous Algorithms and Complexity

 

Est. 1992

AIMS
To provide a forum for international collaboration and for the dissemination of research and applications of continuous algorithms and complexity.

SCOPE
Many problems in natural science, engineering, social science and business have continuous models. Hence the scope of WG 1.1 is algorithms and especially computational complexity of algorithms for solving continuous models. By computational complexity is meant the intrinsic difficulty of solving such problems. Examples of the problems that are being studied include: ordinary and partial differential equations, continuous optimization, multivariate integration and approximation, matrix multiplication, and systems of polynomial equations.
Of special interest is the solution of continuous problems on parallel and distributed computer systems.

 

Designed by Inria-IES Team : HAL-Inria   Hosted by HAL : http://hal.archives-ouvertes.fr/