A Probabilistic Remark on Algebraic Program Testing
Explore this paper's citation graph
Summary
A probabilistic solution is presented which achieves small probability of error on 30 points for m-ary multinomials in Howden's method for algebraic program testing.
- Type
- article
- Published
- 1978-06-01
- Cited by
- 607
- References
- 5
- OpenAlex
- https://openalex.org/W1968245619
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:17311113
Keywords
Monomial, Mathematics, Modulo, Time complexity, Generalization
References
Cited by
- Characterizing generic global rigidity
- Représentations des polynômes, algorithmes et bornes inférieures. (Representations of polynomials, algorithms and lower bounds)
- A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
- Early termination strategies in sparse interpolation algorithms
- Computational complexity in entanglement transformations
- Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae
- Learning polynomials with queries: The highly noisy case
- On the complexity of numerical analysis
- Read-once polynomial identity testing
- The Compressed Word Problem for Groups
- Efficient Computation with Sparse and Dense Polynomials
- MATRIX RANK CERTIFICATION
- TR-2012009: Randomized Matrix Computations IV
- TR-2014009: Estimating the Norms of Random Circulant and Toeplitz Matrices and Their Inverses II
- Randomized Matrix Computations
- A Simple Algorithm for Hamiltonicity
- A conceptual model of software testing
- Spectral Super-Resolution With Prior Knowledge
- Introduction to Treewidth
- Algebraic independence and blackbox identity testing
Related papers
- Towards a bifurcation theory for perturbed monomial dynamical systems modulo a prime
- Research on Reconfigurable Modulo Operation Unit
- The research of reconfigurable multiplication modulo instruction
- An improved scheme of Montgomery algorithm for module power multiplication
- Design Research of 1024-bit RSA Cryptosystem
- Multiplication with Fourier Optics Simulating 16-Bit Modular Multiplication
- A Division-Free Toom–Cook Multiplication-Based Montgomery Modular Multiplication
- Space/Time Trade-Offs for Higher Radix Modular Multiplication Using Repeated Addition
- A Simplified Modulo (2n-1) Squaring Scheme for Residue Number System