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...
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them su...
There are many applications for Secure Multi-Party Computation (SMC), but practical adoption is still an issue. One reason is that the business model of the application does not m...
We define the computability of probability distributions on the real line as well as that of distribution functions. Mutual relationships between the computability notion of a pro...