Symbolic Algebra Compressed Trees in ANF Sum-of-Products Form
Budget: $30 – $250 USD
Develop three Linux command line functions CTPrint, CTXOR, and CTAND
based on the three C functions described in the attached file.
While implementation is preferred in normal ANSI C, it can also be implemented in Python.
The tools will be used for solution of large constraint sets of a hundred or so product terms so fast compact coding is critical. Recursion might simplify the coding, but be aware that worst case ANF can expand to 2^N terms, where that many stack frames may easily fault. A lower state management scheme is likely to be more successful and faster.
based on the three C functions described in the attached file.
While implementation is preferred in normal ANSI C, it can also be implemented in Python.
The tools will be used for solution of large constraint sets of a hundred or so product terms so fast compact coding is critical. Recursion might simplify the coding, but be aware that worst case ANF can expand to 2^N terms, where that many stack frames may easily fault. A lower state management scheme is likely to be more successful and faster.