On the extended direct sum conjecture

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 01 Jan 1989Publisher:ACM PressJournal:Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89

Authors: Nader H. Bshouty;

doi: 10.1145/73007.73024

On the extended direct sum conjecture

- Summary
- Metrics

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.

Related Organizations

Technion – Israel Institute of Technology
Israel

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	7
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average