1209 search results - page 31 / 242 » Universal Algebra and Computer Science |
Lecture Notes
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."
MST
1998
13 years 8 months ago
1998
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 ...
ACMSE
2007
ACM
14 years 20 days ago
2007
ACM
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...
SC
2004
ACM
14 years 2 months ago
2004
ACM
: 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...
FOCS
1997
IEEE
14 years 26 days ago
1997
IEEE
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...