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

Authors:
William Hesse;Eric Allender;David A. Mix Barrington
Affiliations:
School of Computer Science, University of Massachusetts, Amherst, MA 01003-4610, United States;Dept. of Computer Science, Rutgers University, Piscataway, NJ 08854-8019, United States;School of Computer Science, University of Massachusetts, Amherst, MA 01003-4610, United States
Venue:
Journal of Computer and System Sciences
Year:
2014

Citing 6
Cited 0

Uniform constant-depth threshold circuits for division and iterated multiplication

Journal of Computer and System Sciences - Complexity 2001
On Proofs about Threshold Circuits and Counting Hierarchies

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable's Class K

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Type two computational complexity

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Logical Foundations of Proof Complexity

Logical Foundations of Proof Complexity
Root finding with threshold circuits

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 TC^0.