An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of… (More)

We present a new, “greedy”, channel-router that is quick, simple, and highly effective. It always succeeds, usually using no more than one track more than required by channel density. (It may be… (More)

A polynomial p(x) can be evaluated at several points x<subscrpt>1</subscrpt>,...,x<subscrpt>m</subscrpt> by first constructing a polynomial d(x) which has… (More)

The foundations are laid for a theory of multiplicative complexity of algebras and it is shown how “multiplication problems” such as multiplication of matrices, polynomials, quaternions, etc., are… (More)

This paper deals with three aspects of algebraic complexity. The first section is concerned with lower bounds on the number of operations required to compute several functions. Several theorems are… (More)