"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
We have been funded by the University of North Carolina Office of the President [1] to establish a consortium to promote high performance computing at comprehensive universities t...
Rahman Tashakkori, Barry L. Kurtz, Barry Wilkinson...
: Legend says that Archimedes remarked, on the discovery of the lever, “Give me a place to stand, and I can move the world.” Today, computing pervades all aspects of science an...
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...