I came up with a new algorithm to solve the subset sum problem, and I think it\'s in polynomial time. Tell me I\'m either wrong or a total genius.
I came across a situation doing some advanced collision detection, where I needed to calculate the roots of a quartic function.
for example: (3x2 - 5x + 2)(7x + 1) 开发者_如何学JAVAand you simplify it like this: ((3 2)(-5 1)(2 0))((7 1)(1 0))
I\'m implementing the NTRUEncrypt algorithm, according to an NTRU tutorial, a polynomial f has an inverse g such that f*g=1 mod x, basically the polynomial multiplied by its inverse reduced modulo x g
Given a simple data set, I would like to be able to calculate a trending formula given it\'s a second order polynomial regression.
How do I fit a 2D surface z=f(x,y) with a polynomial 开发者_如何学Pythonin numpy with full cross terms?This is inherently numerically ill-conditioned but you could do something like this:
I\'m trying to use operator overloading to define the basic operations (+,-,*,/) for my polynomial class but when i run the program it crashes and my computer frozes.
I\'m doing a polynomial calculator and i\'ll need some help as i\'ll progress with the code. For now I made only the polinom class which i represented it as a linked list with terms and some function
I have a range of data that I have approximated开发者_如何学编程 using a polynomial of degree 2 in Python. I want to calculate the area underneath this polynomial between 0 and 1.
I can\'t find any code for doing this. The only places I can find it is in GIS APIs. Preferably in java, but I can port other languages too. 开发者_Python百科I\'d even settle for a overview of all the
加载中,请稍侯......