Corrigendum: `` The Area-Time Complexity of Binary Multiplication''

Authors' addresses R P, Brent, Department of Computer Science, The Australian Nauonal University, Post Office Box 4, Canberra ACT 2600, Australia; H T Kung, Department of Computer Science, Schenley Park, Carnegie-Mellon Umverslty, Pittsburgh, PA 15213 Permlsston to copy without fee all or part of this material is granted provided that the copies are not made or distnbuted for direct commercial advantage, the ACM copyright notice and the title of the publication and ~ts date appear, and notice is given that copying is by permlsszon of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. © 1982 ACM 0004-5411/82/0700-0904 $00 75