Evaluates a polynomial.
Polynomial Regression
The engine that powers scroll-into-view-if-needed
Robust polynomial regression using LMedS
Evaluate a polynomial using double-precision floating-point arithmetic.
Polynomial Regression 2D
The polynomial kernel
A class of simple polynomial functionality including root finding
Google Compute Engine Client Library for Node.js
Computes the greatest common divisor (gcd).
Computes the least common multiple (lcm).
A library to find JS RegExp with super-linear worst-case time complexity for attack strings that repeat a single character.
JavaScript SDK and CLI for building JavaScript applications on [Fastly Compute](https://www.fastly.com/products/edge-compute/serverless).
Computes the dot product between two numeric arrays.
A generated SDK for ComputeManagementClient.
Computes the L2 norm (Euclidean norm) of an array of values.
Computes the cosine similarity between two arrays.
Pure Javascript implementation of the BLAKE2b and BLAKE2s hash functions
The luma.gl core Device API
Symbolic computing and numeric evaluations for JavaScript and Node.js
Savitzky–Golay filter in Javascript
* implements render engine's interface with WebGPU/WebGL
A practical, root-focused JavaScript polynomial utility library.
Compute a diff of two Slate documents
This is a gem dedicated to parsing, manipulating and finding roots,extrema and inflection points of polynomials. It can solve polynomial equations with a degree up to 4 by implementing formulas for solving quadratic, cubic and quartic functions.
This gem contains command-line utility for solving 0/1 knapsack problem using branch-and-bound method, dynamic programming, simple heuristic (weight/price) and fully polynomial time approximation scheme. It can measure CPU and wall-clock time spent by solving a problem, compute relative error of the result and generate graphs from those values.
No description provided.
No description provided.
No description provided.