Testing Polynomials over General Fields
From MaRDI portal
Publication:3446819
DOI10.1137/S0097539704445615zbMath1120.68058MaRDI QIDQ3446819
Publication date: 26 June 2007
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (16)
Testing Lipschitz functions on hypergrid domains ⋮ Unnamed Item ⋮ Lifted projective Reed-Solomon codes ⋮ 2-transitivity is insufficient for local testability ⋮ Unnamed Item ⋮ The quantum query complexity of learning multilinear polynomials ⋮ Properties of high rank subvarieties of affine spaces ⋮ Polynomial functions as splines ⋮ Limitation on the Rate of Families of Locally Testable Codes ⋮ Invariance in Property Testing ⋮ Testing Linear-Invariant Non-linear Properties: A Short Report ⋮ Testing low-degree polynomials over prime fields ⋮ On Sums of Locally Testable Affine Invariant Properties ⋮ Reed-Muller Codes ⋮ Lower bounds for testing triangle-freeness in Boolean functions ⋮ Exponentially improved algorithms and lower bounds for testing signed majorities
This page was built for publication: Testing Polynomials over General Fields
