Article

Free access

On the extended direct sum conjecture

Author:

N. H. BshoutyAuthors Info & Claims

STOC '89: Proceedings of the twenty-first annual ACM symposium on Theory of computing

Pages 177 - 185

https://doi.org/10.1145/73007.73024

Published: 01 February 1989 Publication History

Abstract

We consider the quadratic complexity of certain sets of quadratic forms. We study a classes of direct sums of quadratic forms. For these classes of problems we show that the complexity of one direct sum is the sum of the complexity of the summands and that every minimal quadratic algorithm for computing the direct sums is a direct-sum algorithm.

References

[1]

A.A. Albert, Structure of algebras, American Mathematical Society Colloquium Publications, Vol XXIV, (1939).

[2]

A. Averbuch, N. H. Bshouty, M. Kaminski, Classification of polynomial multiplication of small degree over finite fields.

[3]

A. Averbuch, Z. Galil, S. Winograd, Classification of all the minimal bilinear algorithm for computing the coefficient of the product of two polynomials modulo a polynomial in the algebra G { u }/< u n >.

[4]

A. Averbuch, Z. Galil, S. Winograd, Classification of all the minimal bilinear algorithm for computing the coefficient of the product of two polynomials modulo a polynomial in the algebra G {u }/ <Q (u )t > l>l, Theoretical Computer Science 58 (1988), 17-56.

Digital Library

[5]

L. Auslander, E. Feig, S. Winograd, Direct Sum of Bilinear Algorithm, Linear Algebra and Its Application 38 (1981), 175-192

[6]

M.D. Atldnson, S. Lloyd, The rank of mxnx(mn-2) tensor s, SIAM J. Compute.12 (1983):611-615.

[7]

M.F. Atiyah, I. G. Macdonald, Introduction to commutative algebra., Addison-Wesley, London, 1969.

[8]

M.D. Atkinson, N. M. Stephens, On the maximal multiplicative complexity of a family of bilinear forms, Linear Algebra and Its Application 27 (1979), 1-8.

[9]

A. Alder, V. Strassen, On the algorithmic complexity of associative algebras, Theoret. Compute. Sci. 15 (1981):201-211.

[10]

N.H. Bshouty, A lower bound for matrix' multiplication, Proceedings 29th Annual Symposium on Foundations of Computer Science, (1988).

Digital Library

[11]

N. H. Bshouty, Maximal rank of m x n x (mn -k ) tensors, TR, Technion.

[12]

N.H. Bshouty, On the algorithmic complexity of associative algebras over finite fields.

[13]

W. Biichi, M. Clausen, On a class of primary algebras of minimal rank, Linear Algebra and Its Applications 69 (1985), 249-268.

[14]

R.W. B rockett, D. Dobkin, On the Optimal Evaluation of a set of Bilinear Forms, Linear Algebra and Its Applications 19 (1978), 207-235.

[15]

D. Dobkin, Jan Van Leeuwen, The complexity of vector-product, Information Processing Letter, 4, (1976), 149- 154.

[16]

E. Feig, On systems of bilinear forms whose minimal division-free algorithms are all bilinear, Journal of Algorithms, 2, (1981), 261-281.

[17]

a. Fellmann, Optimal algorithms for finite dimensional simply generated algebras, LN Comput. Sci. 229,(1986).

[18]

C.M. Fiduccia, Fast matrix multiplication, Proc. 3rd Annual ACM Syrup. on theory of computing (1971), 45-49.

Digital Library

[19]

E. Feig, S. Winograd, On the direct sum conjecture, Linear Algebra and Its Application 63 (1984), 193-219.

[20]

C.M. Feduecia, Y. Zalcstein, Algebras having linear multiplicative complexity, J. ACM 24 (1977), 311-331.

Digital Library

[21]

J. yon zur Gathen, Algebraic complexity theory. In Annual Review of Computer Science 3 (1988). Tech. Rep. 207/88, Dept. of Computer Science, University of Toronto, 1988.

Digital Library

[22]

J. von zur Gathen, Maximal bilinear complexity and codes. Preprint, University of Toronto, (1988).

[23]

H.F. De Groote, On the complexity of quatemion multiplication, Information Processing Letter 3 (1975) 177-179.

[24]

H. F. De Groote, On varieties of optimal algorithms for the computation of bilinear mapping III. Optimal algorithm for the computation of x y and y x where x, y e M2 (K), Theoretical Computer Science 7 (1978), 239-249.

[25]

H.F. De Groote, Characterization of division algebras of minimal rank and the structure of their algorithm varieties, SIAM J. Comput. 12 (1983), 101-117.

[26]

H.G. De Groote, Lectures on the complexity of bilinear problems. LN Cornput. Sci. 245, Springer, Berlin 1987.

Digital Library

[27]

H.F. De Groote, J. Heintz, Commutative algebra of minimal rank, Linear Algebra and its Applications, 55 (1983), 37-68.

[28]

H. F. De Groote, J. Heintz, A lower bound for the bilinear complexity of some semisimple Lie algebras, Algebraic algorithms and error correcting codes. Proc. AAECC-3, Grenoble 1985. LN Comput. Sci. 229, (1986), 211-222.

Digital Library

[29]

J. Hopcroft, J. Munsinski, Duality applied to the complexity of matrix multiplication, SlAM J. Comput. 2 (1973), 159-173.

[30]

J. Heintz, J. Morgenstem, On associative algebras of minimal rank, Proc. of the AAECC-2 Conference (Grenoble 1984).

Digital Library

[31]

J. Ja'Ja' On the complexity of bilinear forms with commutativity, SIAM. J. Comput 9, 4, (1980), 713-728.

[32]

J. Ja' Ja', J. Takche, On the validity of the direct sum conjecture, SIAM. J. Comput 15, 4, (1986), 1004-1020.

Digital Library

[33]

M. Kaminski, N. H. Bshouty, Multiplicative complexity of polynomial multiplication over finite field, Proceedings 28th Annual Symposium on Foundations of Computer Science, (1987).

Digital Library

[34]

A. Lempel, G. Seroussi, S. Winograd, On the Complexity of Multiplication in Finite Fields, Theoret. Comput. Sci. 22 (1983), 285-296.

[35]

R. Mirwald, The algorithmic structure of sl (2, k ), Algebraic algorithms and error correcting codes. AAECC-3 Grenoble 1985. LN Comput. Sci. (1986), 274-287.

Digital Library

[36]

V. Strassen, Vermeidung yon Divisionen, J. Reine Angew. Math. 264 (1973), 184-202.

[37]

S. Winograd, On the Number of Multiplications Necessary to Compute Certain Functions, Comm. Pure and Appl. Math. 23 (1970), 165-179.

[38]

S. Winograd, On multiplication of 2><2 matrices, Linear Algebra and its Applications, 4 (1971), 381-388.

[39]

S. Winograd, Some Bilinear Forms Whose Multiplicative Complexity Depends on the Field Constants, Math. System Theory 10 (1976/77), 169-180.

[40]

S. Winograd, On multiplication in algebraic extension field, Theoret. Comput. Sci.,8 (1979), 359-377.

Cited By

Bshouty N(2005)On the direct sum conjecture in the straight line modelAlgorithms—ESA '9310.1007/3-540-57273-2_46(85-96)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-57273-2_46
(2001)The Communication Complexity of Enumeration, Elimination, and SelectionJournal of Computer and System Sciences10.1006/jcss.2001.176163:2(148-185)Online publication date: 1-Sep-2001
https://dl.acm.org/doi/10.1006/jcss.2001.1761
Kushilevitz EOstrovsky RRosén ACoan BAfek Y(1998)Amortizing randomness in private multiparty computationsProceedings of the seventeenth annual ACM symposium on Principles of distributed computing10.1145/277697.277710(81-90)Online publication date: 1-Jun-1998
https://dl.acm.org/doi/10.1145/277697.277710
Show More Cited By

Index Terms

On the extended direct sum conjecture
1. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Numerical differentiation
    2. Quadrature
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes

Recommendations

Extended path partition conjecture for semicomplete and acyclic compositions
Abstract
Let D be a digraph and let λ ( D ) denote the number of vertices in a longest path of D. For a pair of vertex-disjoint induced subdigraphs A and B of D, we say that ( A , B ) is a partition of D if V ( A ) ∪ V ( B ) = V ( D ). The Path ...
Direct Decomposition about Direct Sum Decomposition of Space
ISIE '11: Proceedings of the 2011 International Conference on Intelligence Science and Information Engineering

Space direct sum decomposition of the algebra plays an important role, This article will explore it from several aspects as follow. The approach to space direct sum decomposition, The application of dimension formulas in space direct sum decomposition, ...
A conjecture on k-transitive digraphs

A digraph is k-transitive, if for any a path x"0x"1...x"k of length k, x"0 dominates x"k. A digraph is a strong k-transitive digraph, if it is k-transitive and it is strongly connected. Cesar Hernandez-Cruz proposed the following conjecture: Let k-1 be ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '89: Proceedings of the twenty-first annual ACM symposium on Theory of computing

February 1989

600 pages

ISBN:0897913078

DOI:10.1145/73007

Editor:
D. S. Johnson

Copyright © 1989 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC89

Sponsor:

SIGACT

STOC89: 21st Annual ACM Symposium on the Theory of Computing

May 14 - 17, 1989

Washington, Seattle, USA

Acceptance Rates

STOC '89 Paper Acceptance Rate 56 of 196 submissions, 29%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
336
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)4

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bshouty N(2005)On the direct sum conjecture in the straight line modelAlgorithms—ESA '9310.1007/3-540-57273-2_46(85-96)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-57273-2_46
(2001)The Communication Complexity of Enumeration, Elimination, and SelectionJournal of Computer and System Sciences10.1006/jcss.2001.176163:2(148-185)Online publication date: 1-Sep-2001
https://dl.acm.org/doi/10.1006/jcss.2001.1761
Kushilevitz EOstrovsky RRosén ACoan BAfek Y(1998)Amortizing randomness in private multiparty computationsProceedings of the seventeenth annual ACM symposium on Principles of distributed computing10.1145/277697.277710(81-90)Online publication date: 1-Jun-1998
https://dl.acm.org/doi/10.1145/277697.277710
Beigel RHirst TVitter J(1998)One help-bit doesn't helpProceedings of the thirtieth annual ACM symposium on Theory of computing10.1145/276698.276720(124-130)Online publication date: 23-May-1998
https://dl.acm.org/doi/10.1145/276698.276720
Karchmer MRaz RWigderson A(1995)Super-logarithmic depth lower bounds via the direct sum in communication complexityComputational Complexity10.1007/BF012063175:3-4(191-204)Online publication date: Sep-1995
https://doi.org/10.1007/BF01206317
Nisan NRudich SSaks M(1994)Products and help bits in decision treesProceedings of the 35th Annual Symposium on Foundations of Computer Science10.1109/SFCS.1994.365683(318-329)Online publication date: 20-Nov-1994
https://dl.acm.org/doi/10.1109/SFCS.1994.365683
Impagliazzo RRaz RWigderson A(1994)A direct product theoremProceedings of IEEE 9th Annual Conference on Structure in Complexity Theory10.1109/SCT.1994.315814(88-96)Online publication date: 1994
https://doi.org/10.1109/SCT.1994.315814
Bshouty N(1992)Lower bounds for the complexity of functions in a realistic RAM modelTheory of Computing and Systems10.1007/BFb0035162(12-23)Online publication date: 1992
https://doi.org/10.1007/BFb0035162
Feder TKushilevitz ENaor MPapadimitriou C(1991)Amortized communication complexity (Preliminary version)Proceedings of the 32nd annual symposium on Foundations of computer science10.1109/SFCS.1991.185374(239-248)Online publication date: 1-Sep-1991
https://dl.acm.org/doi/10.1109/SFCS.1991.185374
Karchmer MRaz RWigderson A(1991)Super-logarithmic depth lower bounds via direct sum in communication complexity[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference10.1109/SCT.1991.160273(299-304)Online publication date: 1991
https://doi.org/10.1109/SCT.1991.160273

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents