Uniform constant-depth threshold circuits for division and iterated multiplication

Journal of Computer and System Sciences

Volumn 65, Issue 4, 2002, Pages 695-716

  Hesse, William ^a   Allender, Eric ^b   Barrington, David A Mix ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Chinese remainder representation; Circuit complexity; Computation in abelian groups; Division; Iterated multiplication; Uniform threshold circuits

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; NETWORKS (CIRCUITS); OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

DLOGTIME; ITERATED MULTIPLICAITON; LINEAR FUNCTIONS; TRADEOFFS;

THRESHOLD ELEMENTS;

EID: 0042889711     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(02)00025-9     Document Type: Conference Paper

References (55)

1. 0, and Arithmetic Circuits, J. Comput. System Sci. 60 (2000) 395-421.
2. M. Agrawal, E. Allender, R. Impagliazzo, T, Pitassi, S. Rudich, Reducing the complexity of reductions, Comput. Complexity 10 (2001) 117-138.
3. E. Allender, The division breakthroughs, L. Fortnow (Ed.), The Computational Complexity Column, EATCS Bull. 74, (2001), 61-77.
4. E. Allender, A. Ambainis, D.A. Mix Barrington, S. Datta, H. LêThanh, Bounded depth arithmetic circuits: counting and closure, in: Proceedings of the 26th International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science, Vol. 1644, 1999, pp. 149-158.
5. E. Allender, D.A. Mix Barrington, Uniform circuits for division: consequences and problems, Electron. Colloq. Comput. Complexity 7 (2000) 65 (preliminary version of this paper).
6. E. Allender, D.A. Mix Barrington, W. Hesse, Uniform circuits for division: consequences and problems, Proceedings of the 16th Annual IEEE Conference on Computational Complexity (CCC-2001), IEEE Computer Society Press, Silver Spring, MD, 2001, pp. 150-159.
7. E. Allender, V. Gore, Rudimentary reductions revisited, Inform. Process. Lett. 40 (1991) 89-95.
8. 0, in: Jin-Yi Cai (Ed.), Advances in Computational Complexity Theory, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 13, AMS Press, Providence, RI, 1993, pp. 21-37.
9. E. Allender, K. Reinhardt, S. Zhou, Isolation, matching, and counting: uniform and nonuniform upper bounds, J. Comput. System Sci. 59 (1999) 164-181.
10. 0 circuits with negative constants, in: MFCS '98: Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 1450, Springer, Berlin, 1998, pp. 409-417.
11. 1, J. Comput. System Sci. 38 (1989) 150-164.
12. D.A. Mix Barrington, N. Immerman, Time, hardware, and uniformity, in: L.A. Hemaspaandra, A.L. Selman (Eds.), Complexity Theory Retrospective II, Springer, Berlin, 1997, pp. 1-22.
13. 1, J. Comput. System Sci. 41 (1990) 274-306.
14. D.A. Mix Barrington, P. Kadau, K.-J. Lange, P. McKenzie, On the complexity of some problems on groups given as multiplication tables, J. Comput. System Sci. 63 (2001) 186-200.
15. P. Beame, S. Cook, J. Hoover, Log depth circuits for division and related problems, SIAM J. Comput. 15 (1986) 994-1003.
16. 1 computation, J. Comput. System Sci. 57 (2) (1998) 200-212.
17. A.K. Chandra, L. Stockmeyer, U. Vishkin, Constant depth reducibility, SIAM J. Comput. 13 (1984) 423-439.
18. A. Chiu, Complexity of parallel arithmetic using the Chinese Remainder representation, Master's Thesis, University of Wisconsin-Milwaukee, 1995.
19. 1, RAIRO Theoret. Inform. Appl. 35 (2001) 259-276.
20. k, and NC, in: Feasible Mathematics: A Mathematical Sciences Institute Workshop held in Ithaca, New York, June 1989, Birkhauser, Basel, 1990, pp. 49-69.
21. R. Constable, Type 2 computational complexity, in: Proceedings of the Fifth ACM Symposium on Theory of Computing (STOC), 1973, pp. 108-121.
22. C. Damm, M. Holzer, Inductive counting for width-restricted branching programs, Inform. Comput. 130 (1996) 91-99.
23. G. Davida, B. Litow, Fast parallel arithmetic via modular representation, SIAM J. Comput. 20 (1991) 756-765.
24. L. Denenberg, Y. Gurevich, S. Shelah, Definability by constant-depth, polynomial-size circuits, Inform. Control 70 (1986) 216-240.
25. P. Dietz, I. Macarie, J. Seiferas, Bits and relative order from residues, space efficiently, Inform. Process. Lett. 50 (1994) 123-127.
26. W. Eberly, Very fast polynomial arithmetic, SIAM J. Comput. 18 (5) (1989) 955-976.
27. W. Eberly, Logarithmic depth circuits for Hermite interpolation, J. Algorithms 16 (3) (1994) 335-360.
28. R. Fagin, M.M. Klawe, N.J. Pippenger, L. Stockmeyer, Bounded-depth, polynomial-size circuits for symmetric functions, Theoret. Comput. Sci. 36 (2-3) (1985) 239-250.
29. L. Fortnow, Time-space tradeoffs for satisfiability, J. Comput. System Sci. 60 (2000) 336-353.
30. J. Hartmanis, L. Berman, On tape bounds for single letter alphabet language processing, Theoret. Comput. Sci. 3 (1976) 213-224.
31. J. Hartmanis, D. Ranjan, Space bounded computations: review and new speculation, in: MFCS '89: Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 379, Springer, Berlin, 1989, pp. 49-66.
32. J. Håstad, Almost optimal lower bounds for small depth circuits, in: S. Micali (Ed.), Randomness and Computation, Advances in Computing Research, Vol. 5, JAI Press, Greenwich, CT, 1989, pp. 143-170.
33. 1+ε processors, manuscript, available online at http://www.nada.kth.se/~johanh/papers.html.
34. 0, Inform. Comput. 108 (2) (1994) 200-211.
35. 0, in: ICALP 2001: 28th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 104-114.
36. N. Immerman, Descriptive Complexity, Springer, Berlin, 1999.
37. N. Immerman, S. Landau, The complexity of iterated multiplication, Inform. Comput. 116 (1) (1995) 103-116.
38. J. Johannsen, Weak bounded arithmetic, the Diffie-Hellman problem, and Constable's class K, in: Proceedings of the 14th IEEE Symposium on Logic in Computer Science (LICS), 1999, pp. 268-274.
39. M. Liśkiewicz, R. Reischuk, Computing with sublogarithmic space, in: L.A. Hemaspaandra, A.L. Selman (Eds.), Complexity Theory Retrospective II, Springer, Berlin, 1997, pp. 197-224.
40. I. Macarie, Space-efficient deterministic simulation of probabilistic automata, SIAM J. Comput. 27 (1998) 448-465.
41. A. Maciel, D. Thérien, Threshold circuits of small majority-depth, Inform. Comput. 146 (1) (1998) 55-83.
42. A. Maciel, D. Thérien, Efficient threshold circuits for power series, Inform. Comput. 152 (1) (1999) 62-73.
43. V.A. Nepomnjaščiǐ, Rudimentary predicates and Turing calculations, Soviet Math. Dokl. 11 (1970) 1462-1465.
44. I. Newman, P. Ragde, A. Wigderson, Perfect hashing, graph entropy, and circuit complexity (preliminary version), in: Proceedings of the Fifth Annual Structure in Complexity Theory Conference, IEEE Computer Society Press, Silver Spring, MD, 1990, pp. 91-99.
45. J. Reif, Logarithmic depth circuits for algebraic functions, SIAM J. Comput. 15 (1986) 231-242.
46. J. Reif, On threshold circuits and polynomial computation, in: Proceedings of the Second Annual Conference on Structure in Complexity Theory, IEEE Computer Society Press, Silver Spring, MD, 1987, pp. 118-123.
47. J. Reif, S. Tate, On threshold circuits and polynomial computation, SIAM J. Comput. 21 (1992) 896-908.
48. J. Reif, S. Tate, Optimal size integer division circuits, SIAM J. Comput. 19 (1990) 912-924.
49. W.L. Ruzzo, On uniform circuit complexity, J. Comput. System Sci. 21 (1981) 365-383.
50. N. Shankar, V. Ramachandran, Efficient parallel circuits and algorithms for division, Inform. Process. Lett. 29 (1998) 307-313.
51. K. Siu, V.P. Roychowdhury, On optimal depth threshold circuits for multiplication and related problems, SIAM J. Discrete Math. 7 (1994) 284-292.
52. A. Szepietowski, If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n, Theoret. Comput. Sci. 74 (1990) 115-119.
53. A. Szepietowski, Turing Machines with Sublogarithmic Space, in: Lecture Notes in Computer Science, Vol. 843, Springer, Berlin, 1994.
54. H. Vollmer, Introduction to Circuit Complexity, Springer, Berlin, 1999.
55. C.B. Wilson, Decomposing NC and AC, SIAM J. Comput. 19 (1990) 384-396.