Zero testing of algebraic functions

DOI10.1016/S0020-0190(96)00207-4zbMath1336.68311OpenAlexW2068832728MaRDI QIDQ286968

Richard Zippel

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00207-4

zbMATH Keywords

learning theoryalgebraic functionsself-testing programssymbolic computingzero testing

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Indecomposability of polynomials via Jacobian matrix ⋮ Zero testing of \(p\)-adic and modular polynomials

Cites Work

• A probabilistic remark on algebraic program testing
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Optimal Multiplication Chains for Computing a Power of a Symbolic Polynomial
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Zero testing of algebraic functions