SIAM Journal on Numerical Analysis, Vol. 48, No. 1 (2010), pp. 322-345 (24 pages) Inverse problems are often ill posed, with solutions that depend sensitively on data. In any numerical approach to the ...

A separable assignment problem (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, f, for assigning item j to bin i; and a separate packing constraint for each bin—i.e., ...

A team at the University at Buffalo has made it possible to simulate complex quantum systems without needing a supercomputer.

A team of physicists from the University at Buffalo has developed a user-friendly method that allows researchers to solve ...

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...

Imagine zooming into matter at the quantum scale, where tiny particles can interact in more than a trillion configurations at once.

Two weeks ago, a modest-looking paper was uploaded to the arXiv preprint server with the unassuming title “On the invariant subspace problem in Hilbert spaces”. The paper is just 13 pages long and its ...

Not long ago, a team of researchers from Stanford and McGill universities broke a 35-year record in computer science by an almost imperceptible margin — four hundredths of a trillionth of a trillionth ...

One summer afternoon in 2001, while visiting relatives in India, Subhash Khot drifted into his default mode — quietly contemplating the limits of computation. For hours, no one could tell whether the ...