I'm looking for a library or computer algebra system that will help compute operations on polynomials in the ring F_2[x_1, ..., x_n] / <f^2 - f> where F_2 is the 2-element finite fie...

I keep getting these hard interview questions. This one really baffles me. You're given a function poly that takes and returns an int. It's actually a polynomial with nonnegative integer coefficie...

I have an integer polynomial in four variables (w, x, y, and z) that I know can be written as an integer polynomial in these six variables: a = w z b = x y c = w^3 + z^3 d = x + y e = w^3 x + y z...

I have polynomials of nontrivial degree (4+) and need to robustly and efficiently determine whether or not they have a root in the interval [0,T]. The precise location or number of roots don't conc...

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. Quick starter facts: Subset sum problem is an NP-c...

I'm having a mental block here, and algebra not really being my thing, can you tell me how to re-write the JavaScript code below to derive the variable, c, in terms of a and b?: a = Math.pow(b, c)...

Background I need to solve polynomials in multiple variables using Horner's scheme in Fortran90/95. The main reason for doing this is the increased efficiency and accuracy that occurs when using H...

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. Update4 Ok. i successfully ma...

I'm looking for an algorithm (or code) to help me compute the inverse a polynomial, I need it for implementing NTRUEncrypt. An algorithm that is easily understandable is what I prefer, there are ps...