Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
We present a new normal form for bounded-curvature paths that admits a combinatorial discription of such paths and a bound on the algebraic complexity of the underlying geometry.
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...
For the families ax4 = by4 +z4 +v4 +w4 , a, b = 1, . . . , 100, and ax3 = by3 + z3 + v3 + w3 , a, b = 1, . . . , 100, of projective algebraic threefolds, we test numerically the co...
Computability and Algebraic Specification J. V. TUCKER University of Wales, Swansea and J. I. ZUCKER McMaster University Abstract computable functions are defined by abstract finit...