How to pronounce “polynomial” in English

So people talk about polynomial speed ups or exponential speed ups.

Let's take this polynomial out of thin air.

So this magic polynomial f3 solved the problem for us.

So that the next polynomial will have the same values at 0 and at 1.

He couldn't multiply polynomials.

I love multiplying polynomials.

interesting lecture about factoring polynomials.

I'll show you some of these polynomials in a second.

So here are some of the polynomials.

So these are actually the polynomials we're looking for.

Because the usual way of defining Bernoulli polynomials and Bernoulli numbers is to write down this formula for the Bernoulli polynomials

Even if I don't know polynomials as a parent, that the school graded those.

implementing hensel's lemma for factoring polynomials or something like this and using this to you know you know

A massive machine, a polynomial machine, which over a huge period of time and always look like glider guns inside doing these very steampunk calculations.

It's a sum of Gaussian's multiplied by polynomials.

The Bernoulli polynomials are polynomials of degree k.

But those three lines completely determine the Bernoulli polynomials.

And this quantum algorithm would factor in polynomial time.

So this is just about a Bernoulli polynomial.

If you plug-in x plus 1 and plug-in x into the third polynomial.

So it's not at all obvious why there's a connection between these particular polynomials and tangent?

Do you think there's something in this thing we're talking about that could be shown if you can do something like polynomial time

And then that makes the search for the solution or the prediction of the next step efficient basically polynomial times, so tractable by a classical system,

Now, if there could be a quantum computer that could solve this problem in polynomial time,

So I just wanted to give you a feel for what that might look like if you achieved a polynomial or an exponential

I'm going to tell you what a Bernoulli polynomial is.

And then, there after we define them by saying each Bernoulli polynomial is just about the integral of the one before it.

We're going to pick the constant of integration, so that this polynomial has the same value at 1 as it does at 0.

And pick the constant of integration, so that the polynomial has the same value of 0 as it does at 1.

You start with a linear function and then second order functions, and then polynomial function.

I've never had a student say, he really knows polynomials.

- And again, going to Perplexity, "Transcendental numbers are 'real' or 'complex' numbers; they are not the root of any nonzero polynomial with

Like, you know, complexity and our understanding of complexity theory and things that scale, and order n squared, and things that scale in polynomial time,

then computing that energy, which I just told you about, only costs a time that scales polynomial in the system, rather than this universe-sized object.

And this led people to see that, classically, this might have an exponential cost and quantum mechanically, it seemed like a modest polynomial cost.

This has the wonderful property that if you plug-in x plus 1, plug-in x into a polynomial and subtract, you get x squared.

The reason that we're going to multiply by a constant before integrating is to make each polynomial begin with x to the k.

And then, if you divide by 3, you end up with the polynomial we started with.

And I actually was told that if you add up the 1/5 powers of numbers from 1 to n, you get a polynomial.

Because quantum computers, if we are assuming that it's Shor's algorithm which can break public key algorithms in polynomial time,

So those constants of integration, which were picked to make the polynomials, have the same value at 1 and at 0 are these numbers

So the difference with text messages is it's done more as a cube, and the its coefficients or polynomials are done in three different directions