Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability

Details Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability

2010-11-11

arxiv.org/abs/1011.2685v2

Computer Science

Logic in Computer Science

Scientific paper

In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the MCM problem optimally. To the best of our knowledge, the proposed encodings and the optimization algorithm are the first formalization of the MCM problem in a PBS manner. This report evaluates the complexity of the problem size and the performance of several PBS solvers over three encodings.

Affiliated with

Also associated with

No associations

Rating

Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-431227