Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!wuarchive!psuvax1!rutgers!aramis.rutgers.edu!paul.rutgers.edu!yoko.rutgers.edu!majidi
From: majidi@yoko.rutgers.edu (Masoud Majidi)
Newsgroups: comp.theory
Subject: efficient algorithms for additions
Keywords: addition
Message-ID: <Feb.14.12.37.29.1991.8441@yoko.rutgers.edu>
Date: 14 Feb 91 17:37:32 GMT
Organization: Rutgers Univ., New Brunswick, N.J.
Lines: 15


Hi,

I am looking for algorithms to add 2 n-bit numbers FAST. Could
somebody please e-mail me (or post to this newsgroup) the name of a
reference which deals with this issue or even better post the
algorithm? What is the running time of the best known algorithm for
this problem?

Thanks in advance for your help,

Masoud Majidi
Department of Computer Science
Rutgers University
New Brunswick, NJ 08901