**On the Shortest Linear Straight-Line Program for Computing Linear Forms***Joan Boyar, René Peralta*

MFCS 2008.

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.

Last modified: Sun Apr 26 15:38:08 CEST 2009 Joan Boyar (joan@imada.sdu.dk)