# Search results for: Ming-Deh Huang

Journal of Symbolic Computation > 2018 > 85 > C > 170-187

Lecture Notes in Computer Science

*signature calculus*.

*efficient*program checkers for two important number theory problems, integer GCD and modular exponentiation. The notion of

*program checkers*was introduced by Manuel Blum as a new approach to the problem of program correctness. Our result regarding checking integer GCD answers an open problem posed by Blum; further-more, the checker we give is a

*constant query*checker. The other result paves...

*p*, and an algebraic set (represented by a system of polynomials) over the finite field F

_{p}, and counts approximately the number of F

_{p}-rational points in the set. For a fixed number of variables, the algorithm runs in random polynomial time with parallel complexity polylogarithmic in the input parameters (number of input polynomials,...

*p*-adic local fields are considered. When the local field contains the necessary roots of unity, the case of curves over local fields is polynomial time reducible to the...

Algorithmica > 2006 > 46 > 1 > 59-68

Journal of Complexity > 2004 > 20 > 2-3 > 284-296

Journal of Symbolic Computation > 2001 > 32 > 3 > 171-189

^{δ}) time where δ is polynomial in g as well as in N. For hyperelliptic...

Journal of Algorithms > 2000 > 37 > 1 > 121-145

Journal of Symbolic Computation > 1998 > 25 > 1 > 1-21

_{q}[x,y,z], which are rational over a ground field F

_{q}. More precisely, we show that if we are given a projective plane curve C of degreen, and if C has only ordinary multiple points, then one can compute the number of F

_{q}-rational points on C in randomized...