 | 1 | initial version |
In my study I have to work with something like 'BooleanPolynomialRing (... 'x', 10)
After that I can create function in the form X1 + x1x3... However I would like to create functions in more generic form like (pseudocode followes ) x[1]+x[2]x[3] where x[1] is equivalent for x1, etc. The final goal is to be able to construct functions programmatically combining indexed expressions like x[i]+x[j] etc
In my study I have to work with something like 'BooleanPolynomialRing (... 'x', 10)
After that I can create function in the form X1 + x1x3... However I would like to create functions in more generic form like (pseudocode followes ) x[1]+x[2]x[3] where x[1] is equivalent for x1, etc. The final goal is to be able to construct functions programmatically combining indexed expressions like x[i]+x[j] etc
In my study I have to work with something like 'BooleanPolynomialRing (... BooleanPolynomialRing(... 'x', 10).
After that I can create function in the form x1 + x1*x3 + ....
x[1] + x[2]*x[3] where x[1] is equivalent for x1, etc. The final goal is to be able to construct functions x[i] + x[j] etc. 
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.