Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...

SIAM Journal on Numerical Analysis, Vol. 35, No. 4 (Aug., 1998), pp. 1684-1708 (25 pages) This paper introduces a general technique for the construction of multistep methods capable of integrating, ...

New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science. But the way to do it ...

The most widely used technique for finding the largest or smallest values of a math function turns out to be a fundamentally difficult computational problem. Many aspects of modern applied research ...

A major advance reveals deep connections between the classes of problems that computers can — and can’t — possibly do. At first glance, the big news coming out of this summer’s conference on the ...

The Journal of the Operational Research Society, Vol. 53, No. 10, Special Issue: Applications and Developments in Mathematical Programming (Oct., 2002), pp. 1109-1117 (9 pages) In the min-max loop ...

Chico Q. Camargo's work has been funded by the Volkswagen foundation, and by the Lloyd’s Register Foundation and the Engineering and Physical Sciences Research Council (EPSRC) via the Alan Turing ...