In a study of the Secant algorithm I am looking for a series expansion of
the algorithm in the form of a polynomial as follows
C2, C3, C4, C5, C6, C7, C8, C9, C10= var('C2 C3 C4 C5 C6 C7 C8 C9 C10')
R.=PowerSeriesRing(SR)
P.=PolynomialRing(SR)
order = 6
f= x+C2*x^2+C3*x^3+C4*x^4+C5*x^5+C6*x^6+C
On Saturday, February 16, 2013 9:38:14 AM UTC+5:30, Santanu wrote:
>
> Dear all,
> I have the following problem.
>
>
> I am working with Boolean variables. So I call the following.
>
> from sage.crypto.boolean_function import BooleanFunction
> R.=BooleanPolynomialRing(10)
>
>
> Suppose during
Hi,
If you have a polynomial f = x1*x2+x3+x4, then isn't f.subs( {x4 :
blablabla] ) what you are looking for ?
Charles
2013/2/16 Santanu Sarkar :
> Dear all,
> I have the following problem.
>
>
> I am working with Boolean variables. So I call the following.
>
> from sage.crypto.boolean_functio
