Purpose of this project is to simplify sum-of-product logic expressions.
-
Updated
Apr 4, 2019 - Java
Purpose of this project is to simplify sum-of-product logic expressions.
You have a range of consecutive numbers, from 1 to n (inclusive). e.g. [1,2,3,4,...,n]. We would like to calculate a sum of a function across the entire range, where the function returns the product of the *preceding* C elements. If there are less than C previous elements, just use the available numbers. i.e. if you are processing the fourth num…
You have a range of consecutive numbers, from 1 to n (inclusive). e.g. [1,2,3,4,...,n]. We would like to calculate a sum of a function across the entire range, where the function returns the product of the *preceding* C elements. If there are less than C previous elements, just use the available numbers. i.e. if you are processing the fourth num…
Add a description, image, and links to the sumofproducts topic page so that developers can more easily learn about it.
To associate your repository with the sumofproducts topic, visit your repo's landing page and select "manage topics."