Division in logspace-uniform NC¹
Chiu, Andrew, Davida, George, and Litow, Bruce (2001) Division in logspace-uniform NC¹. RAIRO - Theoretical Informatics and Applications, 35 (3). pp. 259-275.
![[img]](http://eprints.jcu.edu.au/style/images/fileicons/application_pdf.png) | PDF (Published Version) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 166Kb |
DOI: 10.1051/ita:2001119
View at Publisher Website: http://dx.doi.org/10.1051/ita:2001119
Abstract
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., NC¹ 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 NC¹.
| ID Code: | 491 |
|---|---|
| Item Type: | Article (Refereed Research - C1) |
| Additional Information: | Copyright EDP Sciences 2001 Reproduced with permission from EDP Sciences. RAIRO - Theoretical Informatics and Applications: http://www.rairo-ita.org |
| Keywords: | parallel complexity, NC, integer division, uniformity |
| FoR Codes: | 08 INFORMATION AND COMPUTING SCIENCES > 0802 Computation Theory and Mathematics > 080201 Analysis of Algorithms and Complexity @ 0% |
| SEO Codes: | UNSPECIFIED |
| Deposited On: | 03 Nov 2006 |
| Last Modified: | 19 Dec 2012 15:49 |
| Downloads: | Total: 1 Last 12 Months: 1 |
| Statistics: | More Statistics |
Repository Staff Only: item control page