liveBook · Manning

Polynomial function

A polynomial function is a function expressible as a finite sum of monomials with constant coefficients and nonnegative integer exponents.

How 3 Manning books explain it

Geometry for Programmers

A polynomial is an expression formed from sums of variable powers multiplied by coefficients.

How it is used
Supports approximation, interpolation, and curve construction for geometric modeling.
How deep it goes
Defines forms, degree, roots, derivatives, efficient evaluation, and coefficient-based curve constraints without deriving numerical error analysis.
Examples
Uses cubic, quadratic, and linear graphs, plus a cubic fitted to two points and two tangent directions.
What you can do after
Apply it via coefficient forms and Horner’s scheme to evaluate polynomials and formulate interpolation or tangent constraints.

Read how Geometry for Programmers explains polynomial function →

Elliptic Curve Cryptography for Developers

A polynomial is an algebraic expression formed from coefficients, variables, and nonnegative integer powers combined by addition and multiplication.

How it is used
Supports finite-field extension arithmetic used by elliptic-curve pairing routines.
How deep it goes
Defines representation and utilities, then details modular addition and subtraction while deferring field-extension details.
Examples
Uses a p=1187 degree-three extension, a modular polynomial-sum exercise, and C polynomial routines.
What you can do after
Build it from scratch as fixed-capacity C structures with initialization, cleanup, arithmetic, comparison, printing, and random generation.

Read how Elliptic Curve Cryptography for Developers explains polynomial function →

Real-World Cryptography

A polynomial is a mathematical expression formed from coefficients and nonnegative integer powers of a variable.

How it is used
Encodes several execution constraints as one polynomial for zk-SNARK proving.
How deep it goes
Builds polynomials from roots, selector functions, coefficients, and hidden-point evaluations.
Examples
Uses roots 1, 2, and 3 with equations involving a, b, m, v, and w.
What you can do after
Evaluate/understand how polynomial roots represent correct program constraints while hiding selected values.

Read how Real-World Cryptography explains polynomial function →

Also covered in

What to know first

Related concepts

Questions about polynomial function

What is polynomial function?

A polynomial function is a function expressible as a finite sum of monomials with constant coefficients and nonnegative integer exponents.

Which Manning books explain polynomial function?

Geometry for Programmers, Elliptic Curve Cryptography for Developers and Real-World Cryptography.

What should I know before learning polynomial function?

Manning books that teach polynomial function usually introduce cubic polynomial, coefficient, derivative and digital signature first.

What kinds of polynomial function are there?

Kinds of polynomial function include cubic polynomial, quadratic function and Bézier curve.

What is polynomial function a kind of?

Polynomial function is a kind of mathematical function. A mathematical function is a mapping that assigns exactly one output to each permitted input in its domain.

What are the parts of polynomial function?

Polynomial function includes canonical form.

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.