The complexity of Tensor calculus

Computational Complexity

Volumn 11, Issue 1-2, 2002, Pages 54-89

  Damm, Carsten ^a   Holzer, Markus ^b   McKenzie, Pierre ^c  

^a UNIVERSITY OF GÖTTINGEN   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Algebraic Turing machine; Completeness; Complexity; Counting classes; Permanent; Tensor formula

Indexed keywords

EID: 0242350155     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00037-000-0170-4     Document Type: Article

References (45)

1. L. ADLEMAN (1978). Two theorems on random polynomial time. In Proc. 19th Annual Symposium on Foundations of Comput. Sci., IEEE Comput. Soc. Press, 75-83.
2. E. ALLENDER, J. JIAO, M. MAHAJAN & V. VINAY (1998). Non-commutative arithmetic circuits: depth reduction and size lower bounds. Theoret. Comput. Sci. 209, 47-86.
3. E. ALLENDER & M. OGIHARA (1996). Relationships among PL, #L, and the determinant. RAIRO Theoret. Inform. Appl. 30, 1-21.
4. C. ÀLVAREZ & B. JENNER (1993). A very hard log space counting class. Theoret. Comput. Sci. 107, 3-30.
5. J. L. BALCÁZAR, J. DÍAZ & J. GABARRÓ (1995). Structural Complexity I. Texts in Theoret. Comput. Sci., Springer.
6. 1. J. Comput. System Sci. 38, 150-164.
7. F. BÉDARD, F. LEMIEUX & P. MCKENZIE (1993). Extensions to Barrington's M-program model. Theoret. Comput. Sci. 107, 31-61.
8. R. BEIGEL (1993). The polynomial method in circuit complexity. In Proc. 8th Annual Structure in Complexity Theory Conf., IEEE Comput. Soc. Press, 82-95.
9. A. BEIMEL & A. GÁL (1999). On arithmetic branching programs. J. Comput. System Sci. 59, 195-220.
10. S. J. BERKOWITZ (1984). On computing the determinant in small parallel time using a small number of processors. Inform. Process. Lett. 18, 147-150.
11. G. BUNTROCK, C. DAMM, U. HERTRAMPF & C. MEINEL (1992). Structure and importance of logspace MOD-classes. Math. Systems Theory 25, 223-237.
12. P. BÜRGISSER, M. CLAUSEN & M. A. SHOKROLLAHI (1997). Algebraic Complexity Theory. Grundlehren Math. Wiss. 315, Springer.
13. S. R. BUSS (1987). The Boolean formula value problem is in ALOGTIME. In Proc. 19th Annual Symposium on Theory of Computing, ACM Press, 123-131.
14. S. R. BUSS, S. COOK, A. GUPTA & V. RAMACHANDRAN (1992). An optimal parallel algorithm for formula evaluation. SIAM J. Comput. 21, 755-780.
15. C. DAMM (1990). Problems complete for ⊕L. Inform. Process. Lett. 36, 247-250.
16. #L? Technical Report 8, Fachbereich Informatik der Humboldt-Universität zu Berlin.
17. C. DAMM (1999). Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones. Inform. Process. Lett. 69, 175-179.
18. C. DAMM, M. HOLZER & P. MCKENZIE (2000). The complexity of tensor calculus. In Proc. 15th Annual Conference on Computational Complexity Conf., IEEE Comput. Soc. Press, 70-86.
19. J. A. EISELE & R. M. MASON (1970). Applied Matrix and Tensor Analysis. Wiley.
20. S. FENNER, L. FORTNOW & S. KURTZ (1994). Gap-definable counting classes. J. Comput. System Sci. 48, 116-148.
21. A. GÁL (1995). Semi-unbounded fan-in circuits: Boolean vs. arithmetic. In Proc. 10th Annual Structure in Complexity Conf., IEEE Comput. Soc. Press, 82-87.
22. A. GÁL & A. WIGDERSON (1996). Boolean complexity classes vs. their arithmetic analogs. Random Structures Algorithms 9, 99-111.
23. I. M. GELFAND, M. M. KAPRANOV & A. V. ZELEVINSKY (1994). Discriminants, Resultants, and Multidimensional Determinants. Math. Theory Appl., Birkhäuser.
24. J. HÅSTAD (1990). Tensor rank is NP-complete. J. Algorithms 11, 644-654.
25. N. IMMERMAN & S. LANDAU (1995). The complexity of iterated multiplication. Inform. and Comput. 116, 103-116.
26. R. KARP & R. LIPTON (1982). Turing machines that take advice. Enseign. Math. 28, 191-209.
27. W. KUICH & A. SALOMAA (1986). Semirings, Automata, Languages, Monogr. Theoret. Comput. Sci. 5, Springer.
28. CH. MEINEL (1990). Polynomial size ω-branching programs and their computational power. Inform. and Comput. 85, 163-182.
29. K. MULMULEY (1986). A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. In Proc. 18th Annual Symposium on Theory of Computing, ACM Press, 338-339.
30. K. MULMULEY, U. VAZIRANI & V. V. VAZIRANI (1987). Matching is as easy as matrix inversion. Combinatorica 7, 105-113.
31. R. NIEDERMEIER & P. ROSSMANITH (1995). Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits. Inform. and Comput. 118, 227-245.
32. C. H. PAPADIMITRIOU & S. ZACHOS (1983). Two remarks on the power of counting. In Proc. 6th GI Conference on Theoretical Computer Science, Lecture Notes in Comput. Sci. 145, Springer, 269-275.
33. J. SCHWARTZ (1980). Fast probabilistic algorithms for verification of polynomial identities. J. Assoc. Comput. Mach. 27, 701-717.
34. W.-H. STEEB (1991). Kronecker Product of Matrices and Applications. Wissenschaftsverlag.
35. L. J. STOCKMEYER & A. R. MEYER (1973). Word problems requiring exponential time. In Proc. 5th Annual Symposium on the Theory of Computing, ACM Press, 1-9.
36. V. STRASSEN (1988). The asymptotic spectrum of tensors. J. Reine Angew. Math. 384, 102-152.
37. S. TODA (1991a). Computational Complexity of Counting Complexity Classes. Ph.D. thesis, Tokyo Institute of Technology, Department of Computer Science, Tokyo.
38. S. TODA (1991b). PP is as hard as the polynomial time hierarchy. SIAM J. Comput. 20, 865-877.
39. L. G. VALIANT (1979). The complexity of computing the permanent. Theoret. Comput. Sci. 8, 189-201.
40. L. G. VALIANT & V. V. VAZIRANI (1986). NP is as easy as detecting unique solutions. Theoret. Comput. Sci. 47, 85-93.
41. H. VENKATESWARAN (1991). Properties that characterize LOGCFL. J. Comput. System Sci. 43, 380-404.
42. V. VINAY (1991). Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In Proc. 6th Annual Structure in Complexity Theory Conf., IEEE Comput. Soc. Press, 270-284.
43. I. WEGENER (1987). The Complexity of Boolean Functions. Teubner & Wiley.
44. A. WIGDERSON (1994). NL/poly ⊆ ⊕L/poly. In Proc. 9th Annual Structure in Complexity Theory Conf., IEEE Comput. Soc. Press, 59-62.
45. R. ZIPPEL (1979). Probabilistic algorithms for sparse polynomials. In Proc. International Symposium on Symbolic and Algebraic Manipulation, Lecture Notes in Comput. Sci. 72, Springer, 216-226.