Abstract. We discuss what constitutes knowledge in pure mathematics and how new advances are made and communicated. We describe the impact of computer algebra systems, automated th...
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
We present an algorithm for computing the probability density function of the product of two independent random variables, along with an implementation of the algorithm in a compu...
In a previous paper, we developed an algebraic theory of threads and multi-threads based on strategic interleaving. This theory includes a number of plausible interleaving strategi...
Published results show that various models may be obtained by combining parallel composition with probability and with or without non-determinism. In this paper we treat this probl...