The actual best way to distinguish between complexity classes like BQP and PH is to measure the computational time required to solve a problem in each.

A class of production planning problems is considered in which known demands have to be satisfied over a finite horizon at minimum total costs. For each period, production and storage cost functions ...

This paper proposes a new nested algorithm (NPL) for the estimation of a class of discrete Markov decision models and studies its statistical and computational properties. Our method is based on a ...

Computer Scientists Discover Limits of Major Research Algorithm The most widely used technique for finding the largest or smallest values of a math function turns out to be a fundamentally difficult ...