fr.qz

10 problèmes non résolus en informatique, expliqués

Ces 10 problèmes non résolus en informatique, allant de P contre NP à l'avantage quantique, portent sur la cryptographie, la ...
BIOENGINEER

Bernstein polynomials crack the equations of nanofluid blood flow in stenosed arteries

Mathematicians in India have borrowed a century-old family of polynomials to solve some of the most stubborn equations in ...
rand

Polynomial approximation: a new computational technique in dynamic programming—I

The application of the computational technique of polynomial approximation to problems in dynamic programming. The theoretical applicability of orthogonal polynomials is first discussed and then ...
rand

Some Applications of Polynomial Approximation to Dynamic Programming

An investigation of two polynomial approximation techniques: subregional approximation of a function by low-order Legendre polynomials over sufficiently small subdivisions of the original region of ...
quantumzeitgeist

SyQMA Simulator Achieves Polynomial Memory for Quantum State Representation

A new simulator called SyQMA achieves polynomial memory usage for representing quantum states, a departure from the exponential memory typically required for classical simulation of quantum circuits.
TES

Taylor Polynomial Approximations – Mega Smart Notes (AP Calculus BC Unit 10.11)

Struggling to build Taylor polynomials or use them for approximations? This resource gives you a clear, step-by-step system to construct and apply Taylor and Maclaurin polynomials with confidence, ...
IEEE

Polynomial function approximations with leading integer coefficients for efficient encrypted implementations

Abstract: Computations on encrypted data can, in principle, be performed using homomorphic encryption. However, due to certain limitations, only algorithms based on polynomial functions can be ...
GitHub

Composite Polynomial Approximations to the Sign and Sqrt Functions

This repository contains the figures and report for my master's disseration, Composite Polynomial Approximations to the Sign and Sqrt Functions, at the University of Oxford. Composing low-degree ...
quantumzeitgeist

Quantum Games: Efficient Additive Approximation Algorithm

Researchers at Institution 1 and Institution 2 have made a significant breakthrough in approximating fixed-size quantum correlations in polynomial time. Julius A. Zeiss, Gereon Kossmann, Omar Fawzi, ...
acm.org

Polynomial and spline approximation by quadratic programming

The problem of approximation to a given function, or of fitting a given set of data, where the approximating function is required to have certain of its derivatives of specified sign over the whole ...
PNAS

ON THE WEIGHTED POLYNOMIAL APPROXIMATION IN A LOCALLY COMPACT SPACE

Note: The article usage is presented with a three- to four-day delay and will update daily once available. Due to ths delay, usage data will not appear immediately following publication. Citation ...