Complexity of multilinear problems in the worst case setting

DOI10.1016/0885-064X(90)90030-HzbMath0712.94001OpenAlexW1970593811MaRDI QIDQ749507

Tomasz Jackowski

Publication date: 1990

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(90)90030-h

zbMATH Keywords

complexitysignal processingworst case settinglinear subproblemsmultilinear problems

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Communication, information (94A99) Information theory (general) (94A15) Communication theory (94A05) Numerical linear algebra (65F99)

Related Items

Complexity of multilinear problems in the average case setting, Tractability for Volterra problems of the second kind with convolution kernels, What is the complexity of Stieltjes integration?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item