A.P. Kamath, N.K. Karmarkar, K.G. Ramakrishnan, and M.G.C. Resende
In Proceedings of the 36th MSCAS, pp. 185-189, 1993
ABSTRACT
The Boolean vector function synthesis problem can be
stated as follows: Given a truth table with N input variables and
M output variables, synthesize a Boolean vector function that describes
the table. In this paper we describe a new formulation of the
Boolean vector function synthesis problem as a particular type of
Satisfiability Problem. The Satisfiability Problem is translated
into an integer programming feasibility problem, that is solved with an
interior point algorithm for integer programming. Preliminary
computational results are presented.
PostScript file of full paper
Go back
Mauricio G.C. Resende's Home PageLast modified: 28 June 2002