The complexity of tensor circuit evaluation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2136, Issue , 2001, Pages 173-185

  Beaudry, Martin ^a   Holzer, Markus ^b  

^a UNIVERSITÉ DE SHERBROOKE   (Canada)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; MATRIX ALGEBRA; TENSORS; TIMING CIRCUITS;

BOOLEAN SEMIRING; CIRCUIT EVALUATION; COMMON SENSE; COMPLEXITY THEORY; NATURAL GENERALIZATION; OUTPUT MATRIX; TENSOR CALCULUS; TENSOR FORMULAS;

ELECTRIC NETWORK ANALYSIS;

EID: 84974698162     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44683-4_16     Document Type: Conference Paper

References (18)

1. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Texts in Theoretical Computer Science. Springer Verlag, 1995.
2. 1. Journal of Computer and System Sciences, 38:150-164, 1989.
3. 1. Journal of the Association of Computing Machinery, 35:941-952, 1988.
4. A. Blass and Y. Gurevich. On the unique satisfiability problem. Information and Control, 82:80-88, 1982.
5. G. Buntrock, C. Damm, U. Hertrampf, and C. Meinel. Structure and importance of logspace MOD-classes. Mathematical Systems Theory, 25:223-237, 1992.
6. S. R. Buss. The Boolean formula value problem is in ALOGTIME. In Proceedings of the 19th Symposium on Theory of Computing, pages 123-131. ACM Press, 1987.
7. S. R. Buss, S. Cook, A. Gupta, and V. Ramachandran. An optimal parallel algorithm for formula evaluation. SIAM Journal on Computing, 21(4):755-780, 1992.
8. C. Damm, M. Holzer, and P. McKenzie. The complexity of tensor calculus. In Proceedings of the 15th Conference on Computational Complexity, pages 70-86. IEEE Computer Society Press, 2000
9. L. Fortnow. One complexity theorist’s view of quantum computing. In Electronic Notes in Theoretical Computer Science, volume 31. Elsevier, 2000.
10. L. Hemachandra. The strong exponential hierarchy collapses. Journal of Computer and System Sciences, 39(3):299-322, 1989.
11. N. D. Jones and W. T. Laaser. Complete problems for deterministic polynomial time. Theoretical Computer Science, 3:105-117, 1976.
12. W. Kuich and A. Salomaa. Semirings, Automata, Languages, volume 5 of EATCS Monographs on Theoretical Computer Science. Springer, 1986.
13. C. H. Papadimitriou and M. Yannakakis. The complexity of facets (and some facets of complexity). Journal of Computer and System Sciences, 28(2):244-259, 1984.
14. W.-H. Steeb. Kronecker Product of Matrices and Applications. Wissenschaftsverlag, Mannheim, 1991.
15. R. Tolimieri, M. An, and Ch. Lu. Algorithms for Discrete Fourier Transform and Convolution. Springer Verlag, 1997.
16. L. G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189-201, 1979.
17. V. Vinay. Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In Proceedings of the 6th Structure in Complexity Theory, pages 270-284. IEEE Computer Society Press, 1991.
18. C. Wrathall. Complete sets and the polynomial-time hierarchy. Theoretical Computer Science, 3:23-33, 1977.