On the Shortest Linear Straight-Line Program for Computing Linear Forms
We study the complexity of the Shortest Linear Program (SLP) problem, which is to minimize the number of linear operations necessary to compute a set of linear forms. SLP is shown to be NP-hard. Furthermore, a special case of the corresponding decision problem is shown to be Max SNP-Complete.
Algorithms producing cancellation-free straight-line programs, those in which there is never any cancellation of variables in GF(2), have been proposed for circuit minimization for various cryptographic applications. We show that such algorithms have approximation ratios of at least 3/2 and therefore cannot be expected to yield optimal solutions to non-trivial inputs.
KeywordsApproximation Algorithm Linear Form Approximation Ratio Vertex Cover Minimum Vertex Cover
Unable to display preview. Download preview PDF.
- 3.Boyar, J., Peralta, R.: On building small circuits (2008) (manuscript in preparation)Google Scholar
- 4.Clementi, A.E.F., Trevisan, L.: Improved non-approximability results for vertex cover with density constraints. In: Computing and Combinatorics, pp. 333–342 (1996)Google Scholar
- 7.S̃hokrollahi, M.A., B̃ürgisser, P., Clausen, M.: Algebraic Complexity Theory, ch. 13. Springer, Heidelberg (1997)Google Scholar
- 10.Valiant, L.G.: Completeness classes in algebra. In: Proceedings of the 11th Annual ACM Symposium on the Theory of Computing, pp. 249–261 (1979)Google Scholar
- 11.Williams, R.: Matrix-vector multiplication in sub-quadratic time (some preprocessing required). In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 995–1001 (2007)Google Scholar