vc - / / / / / Arup Guha 11/18/2010 Example of a polynomial...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
// Arup Guha // 11/18/2010 // Example of a polynomial time reduction from Vertex Cover to Subset Sum // Included is a 2^n solution for Subset Sum. / import java.util.*; import java.io.*; import java.math.*; i class subsum { c private BigInteger[] numbers; private BigInteger target; p // values stores the digits of each number in the set. // total stores the digits of the target // base is the base in which we want to interpret these // arrays of digits. public subsum(byte[][] values, byte[] total, byte base) { p numbers = new BigInteger[values.length]; n // Convert each of the set items to BigIntegers. for (int i=0; i<numbers.length; i++) numbers[i] = convert(values[i], base); n target = convert(total, base); } // A reasonable representation of this instance of Subset Sum. public String toString() { p String ans = "{"; for (int i=0; i<numbers.length-1; i++) ans = ans + numbers[i] + ", "; ans = ans + numbers[numbers.length-1]+"} Target = "+ target; a return ans; } // Get the ball rolling. .. public boolean solve() {
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

vc - / / / / / Arup Guha 11/18/2010 Example of a polynomial...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online