Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Synthesizing Shortest Linear Straight-Line Programs over GF(2) using SAT
 

Summary: Synthesizing Shortest Linear Straight-Line
Programs over GF(2) using SAT
Carsten Fuhs1
and Peter Schneider-Kamp2
1
LuFG Informatik 2, RWTH Aachen University, Germany
fuhs@informatik.rwth-aachen.de
2
IMADA, University of Southern Denmark, Denmark
petersk@imada.sdu.dk
Abstract. Non-trivial linear straight-line programs over the Galois field
of two elements occur frequently in applications such as encryption or
high-performance computing. Finding the shortest linear straight-line
program for a given set of linear forms is known to be MaxSNP-complete,
i.e., there is no -approximation for the problem unless P = NP.
This paper presents a non-approximative approach for finding the short-
est linear straight-line program. In other words, we show how to search
for a circuit of XOR gates with the minimal number of such gates. The
approach is based on a reduction of the associated decision problem ("Is
there a program of length k?") to satisfiability of propositional logic.

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences