|Title:||Tile Direct Sum Conjecture in the Straight Line Model
|Authors:||Nader H. Bshouty
|Abstract:||We prove that if a quadratic system satisfies the direct sum conjecture strongly in the quadratic algorithm model, then it satisfies the direct sum conjecture strongly in the straight line algorithm model. Therefore if the sttong direct sum conjecture is true for the quadratic algorithms model then it is also true for the straight line algorithm model. We also use this to classify all the minimal programs that compu~e the product of two polynomials modulo a squarfree polynomial and many other direct sum of quadratic systems.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1989/CS/CS0580), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1989
To the main CS technical reports page
Computer science department, Technion