Division Is In Uniform TC0
- 4 July 2001
- book chapter
- Published by Springer Nature
- p. 104-114
- https://doi.org/10.1007/3-540-48224-5_9
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Descriptive ComplexityPublished by Springer Nature ,1999
- The Complexity of Iterated MultiplicationInformation and Computation, 1995
- On Threshold Circuits and Polynomial ComputationSIAM Journal on Computing, 1992
- Fast Parallel Arithmetic via Modular RepresentationSIAM Journal on Computing, 1991
- On uniformity within NC1Journal of Computer and System Sciences, 1990
- Log Depth Circuits for Division and Related ProblemsSIAM Journal on Computing, 1986
- Almost optimal lower bounds for small depth circuitsPublished by Association for Computing Machinery (ACM) ,1986
- Bounded-depth, polynomial-size circuits for symmetric functionsTheoretical Computer Science, 1985
- A theorem on probabilistic constant depth ComputationsPublished by Association for Computing Machinery (ACM) ,1984
- Parity, circuits, and the polynomial-time hierarchyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981