| Issue |
RAIRO-Theor. Inf. Appl.
Volume 35, Number 3, May/June 2001
|
|
|---|---|---|
| Page(s) | 259 - 275 | |
| DOI | https://doi.org/10.1051/ita:2001119 | |
| Published online | 15 April 2002 | |
Division in logspace-uniform NC1
1
EECS Department, University of Wisconsin-Milwaukee,
Milwaukee, WI, U.S.A.
2
EECS Department, University of
Wisconsin-Milwaukee, Milwaukee, WI, U.S.A.; e-mail: davida@cs.uwm.edu
3
School of Information Technology,
James Cook University,
Townsville, Qld. 4811, Australia; e-mail: bruce@cs.jcu.edu.au
Received:
25
June
2000
Accepted:
3
August
2001
Beame, Cook and Hoover were the first to exhibit a log-depth, polynomial size circuit family for integer division. However, the family was not logspace-uniform. In this paper we describe log-depth, polynomial size, logspace-uniform, i.e., NC1 circuit family for integer division. In particular, by a well-known result this shows that division is in logspace. We also refine the method of the paper to show that division is in dlogtime-uniform NC1.
Mathematics Subject Classification: 68Q05 / 68Q10 / 68Q15 / 68Q17
Key words: Parallel complexity / NC / integer division / uniformity.
© EDP Sciences, 2001
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.