menu
{ "item_title" : "DPMax", "item_author" : [" Christian Colossus "], "item_description" : "DPMax means 'Dynamic Programming to the Max'. It is a software tool that performs the textual and graphical analyses of common dynamic programming (DP) algorithms. It focusses on two DP algorithms: Longest Common Subsequence and Longest Paths by Weights.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/1/79/476/110/1794761101_b.jpg", "price_data" : { "retail_price" : "21.47", "online_price" : "21.47", "our_price" : "21.47", "club_price" : "21.47", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
DPMax|Christian Colossus

DPMax : Dynamic Programming to the Max

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

DPMax means 'Dynamic Programming to the Max'. It is a software tool that performs the textual and graphical analyses of common dynamic programming (DP) algorithms. It focusses on two DP algorithms: Longest Common Subsequence and Longest Paths by Weights.

This item is Non-Returnable

Details

  • ISBN-13: 9781794761100
  • ISBN-10: 1794761101
  • Publisher: Lulu.com
  • Publish Date: November 2019
  • Dimensions: 9 x 6 x 0.3 inches
  • Shipping Weight: 0.44 pounds
  • Page Count: 128

Related Categories

You May Also Like...

    1

BAM Customer Reviews