Non-commutative arithmetic circuits: Depth reduction and size lower bounds

Theoretical Computer Science

Volumn 209, Issue 1-2, 1998, Pages 47-86

  Allender, Eric ^a,c   Jiao, Jia ^b   Mahajan, Meena ^c   Vinay, V ^c,d  

^a RUTGERS UNIVERSITY   (United States)

^b Univ of Arkansas at Little Rock ^*  (United States)

^c INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^d INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Arithmetic circuits; AuxPDAs; Depth Complexity; Non commutative computation; Skew circuits

Indexed keywords

EID: 0002507290     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00227-2     Document Type: Article

References (57)

1. M. Agrawal, On the isomorphism problem for weak reducibilities, J. Computer Sys. Sci. 53 (1996) 267-282. Preliminary version in Proc. 9th Structure in Complexity Theory Conference (1994) 338-355.
2. M. Agrawal, On the isomorphism problem for weak reducibilities, J. Computer Sys. Sci. 53 (1996) 267-282. Preliminary version in Proc. 9th Structure in Complexity Theory Conference (1994) 338-355.
3. 0, and arithmetic circuits, Proc. 12th IEEE Conference on Computational Complexity, 1997, 134-148.
4. E. Allender, P-uniform circuit complexity, J. ACM 36 (1989) 912-928.
5. E. Allender, D. Bruschi, G. Pighizzini, The complexity of computing maximal word functions, Comput. Complexity 3 (1993) 368-391.
6. E. Allender, V. Gore, A uniform circuit lower bound for the permanent, SIAM J. Comput. 23 (1994) 1026-1049.
7. E. Allender, U. Hertrampf, Depth reduction for circuits of unbounded fanin, Inform. and Comput. 112 (1994) 217-238.
8. E. Allender, J. Jiao, Depth reduction for non-commutative arithmetic circuits, in: Proc. 25th Annual Symp. on Theory Comput., 1993, pp. 515-522.
9. C. Álvarez, B, Jenner, A very hard log-space counting class, Theoret. Comput. Sci. 107 (1993) 3-30.
10. C. Álvarez, B. Jenner, A note on log space optimization, Comput. Complexity 5 (1995) 155-166.
11. E. Allender, M. Ogihara, Relationships among PL, #L, and the determinant, RAIRO Theoretical Information and Applications 30 (1996), 1-21. Preliminary version in Proc. 9th IEEE Structure in Complexity Theory Conference, 1994, 267-278.
12. E. Allender, M. Ogihara, Relationships among PL, #L, and the determinant, RAIRO Theoretical Information and Applications 30 (1996), 1-21. Preliminary version in Proc. 9th IEEE Structure in Complexity Theory Conference, 1994, 267-278.
13. P.W. Beame, S.A. Cook, H.J. Hoover, Log depth circuits for division and related problems, SIAM J. Comput. 15 (1986) 994-1003.
14. R. Beigel, J. Tarui, On ACC, Computational Complexity 4 (1994) 350-366. Special issue devoted to the 4th Annual McGill Workshop on Complexity Theory. Preliminary version in Proc. 32nd FOCS (1991) 783-792.
15. R. Beigel, J. Tarui, On ACC, Computational Complexity 4 (1994) 350-366. Special issue devoted to the 4th Annual McGill Workshop on Complexity Theory. Preliminary version in Proc. 32nd FOCS (1991) 783-792.
16. J. Boyar, G. Frandsen, G. Sturtivant, An arithmetical model of computation equivalent to threshold circuits, Theoret. Comput. Sci. 93 (1992) 303-319.
17. F.-J. Brandenberg, On one-way auxiliary pushdown automata, in: Proc. 3rd GI Conf., Lecture notes in Computer Science, vol. 48, Springer, Berlin, 1977, pp. 133-144.
18. H.J. Burtschick, Berechnungs- und Beschreibunskomplexität von Zählfunctionen und Lindströmquantoren, Doctoral Dissertation, Technische Universität Berlin, 1996.
19. S. Chari, P. Rohatgi, A. Srinivasan, Randomness-optimal unique element isolation, with applications to perfect matching and related problems, SIAM Journal on Computing 24(5) (1995) 1036-1050. Preliminary version in Proc. 25th STOC (1993) 458-467.
20. S. Chari, P. Rohatgi, A. Srinivasan, Randomness-optimal unique element isolation, with applications to perfect matching and related problems, SIAM Journal on Computing 24(5) (1995) 1036-1050. Preliminary version in Proc. 25th STOC (1993) 458-467.
21. S. Cook, Characterization of pushdown machines in terms of time-bounded computers, J. ACM 18 (1971) 4-18.
22. #L?, Informatik-Preprint 8, Fachbereich Informatik der Humboldt-Universität zu Berlin, 1991.
23. O. Gabber, Z. Galil, Explicit constructions of linear size superconcentrators, in: Proc. 20th FOCS, 1979, pp. 364-370.
24. S. Gupta, Isolating an odd number of elements and applications in complexity theory, Theory of Computing Systems, to appear (formerly Math. Systems Theory).
25. J. Hartmanis, S. Mahaney, Languages simultaneously complete for one-way and two-way log-tape automata, SIAM J. Comput. 10 (1981) 383-390.
26. D. Huynh, The complexity of ranking simple languages, Mathematical Systems Theory 23 (1990) 1-19.
27. N. Immerman, S. Landau, The complexity of iterated multiplication, Inform. and Comput. 116 (1995) 103-116.
28. R. Impagliazzo, D. Zuckerman, How to recycle random bits, in: Proc. 30th FOCS, 1989, pp. 248-253.
29. B. Jenner, personal communication.
30. M. Jerrum, M. Snir, Some exact complexity results for straight-line computations over semirings, J. ACM 29 (1982) 874-897.
31. R. Kannan, H. Venkateswaran, V. Vinay, A. Yao, A circuit-based proof of Toda's theorem, Inform. and Comput. 104 (1993) 271-276.
32. J. Köbler, Extension of Toda's theorem to middle bit classes, in: Proc. Workshop on Algebraic Methods in Complexity Theory (AMCoT), 11-13 December 1994, Institute of Mathematical Sciences, Madras, Technical Report IMSc-94/51.
33. S.R. Kosaraju, On the parallel evaluation of classes of circuits, in: Proc. 10th FST&TCS, Lecture Notes in Computer Science, vol. 472, Springer, Berlin, 1990, pp. 232-237.
34. M. Krentel, The complexity of optimization problems, J. Comput. System. Sci. 36 (1988) 490-509.
35. G. Miller, V. Ramachandran, E. Kaltofen, Efficient parallel evaluation of straight-line code and arithmetic circuits, SIAM J. Comput. 17 (1988) 687-695.
36. G. Miller, S.-H. Teng, Dynamic parallel complexity of computational circuits, in: Proc. 19th STOC, 1987, pp. 478-489.
37. M. Mahajan, V. Vinay, Non-commutative computation, depth reduction and skew circuits, in: Proc. 14th FST&TCS, Lecture Notes in Computer Science, vol. 880, 1994, pp. 48-59.
38. K. Mehlhorn, E. Schmidt, Las Vegas is better than determinism in VLSI and distributed computing, in: Proc. 14th STOC, 1982, pp. 330-337.
39. A. Naik, K. Regan, D. Sivakumar, On quasilinear time complexity theory, Theoretical Computer Science 148(2) (1995) 325-329. Preliminary version in Proc. 11th STACS, Lecture Notes in Computer Science 778 (1994) 289-300.
40. A. Naik, K. Regan, D. Sivakumar, On quasilinear time complexity theory, Theoretical Computer Science 148(2) (1995) 325-329. Preliminary version in Proc. 11th STACS, Lecture Notes in Computer Science 778 (1994) 289-300.
41. R. Niedermeier, P. Rossmanith, Unambiguous auxiliary pushdown automata and semi-unbounded fanin circuits, Inform. and Comput. 118 (1995) 227-245.
42. N. Nisan, Lower bounds for non-commutative computation, in: Proc. 23rd STOC, 1991, pp. 410-418.
43. J. Reif, S. Tate, On threshold circuits and polynomial computation, SIAM J. Comput. 21 (1992) 896-908.
44. W. Ruzzo, On Uniform Circuit Complexity, J. Comput. System Sci. 21 (1981) 365-383.
45. I.H. Sudborough, On the tape complexity of deterministic context-free languages, J. ACM 25 (1978) 405-414.
46. S. Toda, PP is as hard as the polynomial-time hierarchy SIAM J. Comput. 20 (1991) 865-877.
47. S. Toda, Classes of arithmetic circuits capturing the complexity of computing the determinant, IEICE Trans. Inform. Syst., E75-D (1992) 116-124.
48. S. Toda, Counting problems computationally equivalent to the determinant, manuscript.
49. L. Valiant, Completeness classes in algebra, in: Proc. 11th STOC, 1979, pp. 249-261.
50. L. Valiant, Why is Boolean complexity theory difficult? in: M.S. Paterson (Ed.), Boolean Function Complexity, London Mathematical Society Lecture Notes Series, vol. 169, Cambridge University Press, Cambridge, 1992.
51. L. Valiant, S. Skyum, S. Berkowitz, C. Rackoff, Fast parallel computation of polynomials using few processors, SIAM J. Comput. 12 (1983) 641-644.
52. L. Valiant, V. Vazirani, V, NP is as easy as detecting unique solutions, Theoret. Comput. Sci. 47 (1986) 85-93.
53. H. Venkateswaran, Properties that characterize LOGCFL, J. Comput. System. Sci. 42 (1991) 380-404.
54. H. Venkateswaran, Circuit definitions of non-deterministic complexity classes, SIAM J. Comput. 21 (1992) 655-670.
55. H. Venkateswaran, M. Tompa, A new pebble game that characterizes parallel complexity classes, SIAM J. Comput. 18 (1989) 533-549.
56. V. Vinay, Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits, in: Proc. 6th IEEE Structure in Complexity Theory Conf., 1991, pp. 270-284.
57. V. Vinay, Semi-unboundedness and complexity classes, Doctoral Dissertation, Indian Institute of Science, Bangalore, July 1991.