Randomized interpolation and approximation of sparse polynomials

Yishay Mansour

doi:10.1137/S0097539792239291

Randomized interpolation and approximation of sparse polynomials

Yishay Mansour^*

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

65 Scopus citations

Abstract

We present a randomized algorithm that interpolates a sparse polynomial in polynomial time in the bit complexity model. The algorithm can be also applied to approximate polynomials that can be approximated by sparse polynomials (the approximation is in the L₂ norm).

Original language	English
Pages (from-to)	357-368
Number of pages	12
Journal	SIAM Journal on Computing
Volume	24
Issue number	2
DOIs	https://doi.org/10.1137/S0097539792239291
State	Published - 1995

Access to Document

10.1137/S0097539792239291

Cite this

@article{123c5b29503841099aee68915c56dc1f,

title = "Randomized interpolation and approximation of sparse polynomials",

abstract = "We present a randomized algorithm that interpolates a sparse polynomial in polynomial time in the bit complexity model. The algorithm can be also applied to approximate polynomials that can be approximated by sparse polynomials (the approximation is in the L2 norm).",

author = "Yishay Mansour",

year = "1995",

doi = "10.1137/S0097539792239291",

language = "אנגלית",

volume = "24",

pages = "357--368",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics (SIAM)",

number = "2",

}

TY - JOUR

T1 - Randomized interpolation and approximation of sparse polynomials

AU - Mansour, Yishay

PY - 1995

Y1 - 1995

N2 - We present a randomized algorithm that interpolates a sparse polynomial in polynomial time in the bit complexity model. The algorithm can be also applied to approximate polynomials that can be approximated by sparse polynomials (the approximation is in the L2 norm).

AB - We present a randomized algorithm that interpolates a sparse polynomial in polynomial time in the bit complexity model. The algorithm can be also applied to approximate polynomials that can be approximated by sparse polynomials (the approximation is in the L2 norm).

UR - http://www.scopus.com/inward/record.url?scp=0029292087&partnerID=8YFLogxK

U2 - 10.1137/S0097539792239291

DO - 10.1137/S0097539792239291

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0029292087

SN - 0097-5397

VL - 24

SP - 357

EP - 368

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 2

ER -

Randomized interpolation and approximation of sparse polynomials

Abstract

Access to Document

Other files and links

Fingerprint

Cite this