Memoized Evaluation of Multilinear Lagrange Interpolating Polynomials
September 03, 2024Memoized Evaluation of Multilinear Lagrange Interpolating Polynomials
Written by Breads
Memoized Evaluation of Multilinear Lagrange Interpolating Polynomials
Streaming Based Evaluation of Multilinear Lagrange Interpolating Polynomials
Low communication protocol for comparing messages using multilinear extensions instead of Reed-Solomon
Univariate Lagrange interpolation as a technique for obtaining a unique low-degree extension polynomial for a dataset
The Schwartz-Zippel Lemma for multivariate polynomials and justification of distance amplification in univariate extension polynomials
Frievald's Algorithm for Probabilistic Proof of Matrix Products based on Reed-Solomon fingerprinting
Generalization of vector spaces to polynomials and applications in low degree extensions
Purpose of low degree extensions, interpolation and coefficient based approaches to generating extensions, and linear algebraic perspective
Multilinear Lagrange interpolation and uniqueness of multilinear extensions of functions over the v-dimensional hypercube
Distance amplifying extensions of multivariate polynomials, comparison of v-dimensional hypercube and univariate domains
Reed-Solomon Encoding and Fingerprinting notes, randomness to improve efficiency
Formalization of interactive proofs for languages of decision problems
Interactive probabilistic proof systems (not in zero knowledge) feat. deterministic provers and argument systems
Optimization that reduces evaluation of a univariate low degree extension at a field element from $O(n^2)$ to $O(n)$ time
Reed-Solomon Encoding and Fingerprinting for efficient probabilistic comparison of data, distance amplification via error correcting codes