Results 1  10
of
1,095
Polynomial reconstruction of the matching polynomial
, 2014
"... The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vertexdeleted subgraphs of the same graph. This not ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vertexdeleted subgraphs of the same graph
The Polynomial Reconstruction Problem and its
"... The Polynomial Reconstruction Problem (PRP) has been introduced in 1999 as a new hard problem. Several cryptographic primitives established on this problem have been constructed. Then it has been studied from the point of view of robustness, and several important properties have been discovered and ..."
Abstract
 Add to MetaCart
The Polynomial Reconstruction Problem (PRP) has been introduced in 1999 as a new hard problem. Several cryptographic primitives established on this problem have been constructed. Then it has been studied from the point of view of robustness, and several important properties have been discovered
Cryptanalysis of a PublicKey Encryption Scheme Based on the Polynomial Reconstruction Problem
 Jianying Zhou (Eds.): Public Key Cryptography  PKC 2004, 7th International Workshop on Theory and Practice in Public Key Cryptography, Singapore, March 14, 2004. Lecture Notes in Computer Science 2947
, 2003
"... We describe a cryptanalysis of a publickey encryption scheme based on the polynomial reconstruction problem . Given the publickey and a ciphertext, we recover the corresponding plaintext in polynomial time. Therefore, the scheme is not oneway. ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We describe a cryptanalysis of a publickey encryption scheme based on the polynomial reconstruction problem . Given the publickey and a ciphertext, we recover the corresponding plaintext in polynomial time. Therefore, the scheme is not oneway.
Piecewise Polynomial Reconstruction of Functions from Simplified
, 2015
"... HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract
 Add to MetaCart
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Pseudospectral Fourier reconstruction with the modified inverse polynomial reconstruction method
 J. Comput. Phys
"... The Inverse Polynomial Reconstruction Method (IPRM) has been recently introduced by J.H. Jung and B. Shizgal in order to remedy the Gibbs phenomenon, see [2], [3], [4], [5]. Their main idea is to reconstruct a given function from its n Fourier coefficients as an algebraic polynomial of degree n − ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
The Inverse Polynomial Reconstruction Method (IPRM) has been recently introduced by J.H. Jung and B. Shizgal in order to remedy the Gibbs phenomenon, see [2], [3], [4], [5]. Their main idea is to reconstruct a given function from its n Fourier coefficients as an algebraic polynomial of degree n
A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem
 in "Advances in Cryptology  EUROCRYPT 2003", E. BIHAM (editor), Lecture Notes in Computer Science, n o 2656
"... Abstract. The Polynomial Reconstruction problem (PR) has been introduced in 1999 as a new hard problem. Several cryptographic primitives established on this problem have been constructed, for instance Naor and Pinkas have proposed a protocol for oblivious polynomial evaluation. Then it has been stud ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Abstract. The Polynomial Reconstruction problem (PR) has been introduced in 1999 as a new hard problem. Several cryptographic primitives established on this problem have been constructed, for instance Naor and Pinkas have proposed a protocol for oblivious polynomial evaluation. Then it has been
A FINITE VOLUME SCHEME FOR THE SHALLOWWATER SYSTEM WITH THE POLYNOMIAL RECONSTRUCTION
"... We present a new very highorder finite volume scheme for the shallowwater system based on the local Polynomial Reconstruction Operator (PROscheme) and the MOOD technique to guaranty the solution stability. We detail the design of the scheme and provide two examples with regular solution of wave ..."
Abstract
 Add to MetaCart
We present a new very highorder finite volume scheme for the shallowwater system based on the local Polynomial Reconstruction Operator (PROscheme) and the MOOD technique to guaranty the solution stability. We detail the design of the scheme and provide two examples with regular solution of wave
Ideal spatial adaptation by wavelet shrinkage
 Biometrika
, 1994
"... With ideal spatial adaptation, an oracle furnishes information about how best to adapt a spatially variable estimator, whether piecewise constant, piecewise polynomial, variable knot spline, or variable bandwidth kernel, to the unknown function. Estimation with the aid of an oracle o ers dramatic ad ..."
Abstract

Cited by 1269 (5 self)
 Add to MetaCart
spline ts and piecewisepolynomial ts, when equipped with an oracle to select the knots, are not dramatically more powerful than selective wavelet reconstruction with an oracle. We develop a practical spatially adaptive method, RiskShrink, which works by shrinkage of empirical wavelet coe cients. Risk
A fast inverse polynomial reconstruction method based on conformal fourier transformation
 Progress In Electromagnetics Research
"... is proposed to efficiently eliminate the Gibbs phenomenon in Fourier reconstruction of discontinuous functions. The framework of the fast IPRM is modified by reconstructing the function in discretized elements, then the Conformal Fourier Transform (CFT) and the Chirp ZTransform (CZT) algorithms are ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(MN), respectively, where L is the number of the discretized elements, M is the degree of polynomials for the reconstruction of each element, and N is the number of the Fourier series. Numerical results demonstrate that the fast IPRM method not only inherits the robustness of the Generalized IPRM (GIPRM) method
Classical and quantum polynomial reconstruction via Legendre symbol evaluation
 Journal of Complexity
, 2004
"... We consider the problem of recovering a hidden monic polynomial f(X) of degree d ≥ 1 over a finite field Fp of p elements given a black box which, for any x ∈ Fp, evaluates the quadratic character of f(x). We design a classical algorithm of complexity O(d 2 p d+ε) and also show that the quantum quer ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We consider the problem of recovering a hidden monic polynomial f(X) of degree d ≥ 1 over a finite field Fp of p elements given a black box which, for any x ∈ Fp, evaluates the quadratic character of f(x). We design a classical algorithm of complexity O(d 2 p d+ε) and also show that the quantum
Results 1  10
of
1,095