Scott Lilienthal

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper introduces a deterministic algorithm for solving an instance of the Subset Sum Problem based on a new method entitled the Bipartite Synthesis Method. The algorithm is described and shown to have worst-case limiting performance over similar to the best deterministic algorithms achieving run time complexity on the order of O(2 0.5n). This algorithm(More)
  • 1