Corrigendum to “Uniform constant-depth threshold circuits for division and iterated multiplication” [J. Comput. System Sci. 65 (4) (2002) 695–716]

William Hesse; Eric Allender; David A. Mix Barrington

doi:10.1016/j.jcss.2013.09.002

Back

Corrigendum to “Uniform constant-depth threshold circuits for division and iterated multiplication” [J. Comput. System Sci. 65 (4) (2002) 695–716]

Journal article

Open access

Peer reviewed

Corrigendum to “Uniform constant-depth threshold circuits for division and iterated multiplication” [J. Comput. System Sci. 65 (4) (2002) 695–716]

William Hesse, Eric Allender and David A. Mix Barrington

Journal of computer and system sciences, Vol.80(2), pp.496-497

03/2014

DOI: https://doi.org/10.1016/j.jcss.2013.09.002

Abstract

Threshold circuits

Division

Proof theory

Uniformity

In this corrigendum, we retract part of our Corollary 6.6, which was presented as an immediate and obvious consequence of our main theorem, which showed that division lies in Dlogtime-uniform TC0.

Files and links (1)

url

https://doi.org/10.1016/j.jcss.2013.09.002View

Version of Record (VoR) Open

Metrics

7 Record Views

Details

Title: Corrigendum to “Uniform constant-depth threshold circuits for division and iterated multiplication” [J. Comput. System Sci. 65 (4) (2002) 695–716]
Creators: William Hesse - School of Computer Science, University of Massachusetts, Amherst, MA 01003-4610, United States
Eric Allender - Dept. of Computer Science, Rutgers University, Piscataway, NJ 08854-8019, United States
David A. Mix Barrington - School of Computer Science, University of Massachusetts, Amherst, MA 01003-4610, United States
Publication Details: Journal of computer and system sciences, Vol.80(2), pp.496-497
Date published: 03/2014
Publisher: Elsevier Inc
Academic Unit: Computer Science (SAS)
Language: English
Resource Type: Journal article
Identifiers: 991031654456404646