Ming-Deh A. Huang
- 1.E. Kaltofen and B. M. Trager. Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, faetorizafion, separation of numerators and denominators. Journal of Symbolic Computation, 9(3):300-320, March 1990. Google Scholar
Digital Library
- 2.Joachim von zur Oathen and Erich Kaltofen. Factoring sparse multivariate polynomials. Journal of Computer and System Sciences, 31(2):265-287, October 1985. Google ScholarDigital Library
- 3.Ming-Deh Huang and Ashwin Rao. Interpolation of sparse multivariate polynomials over large finite fields with applications. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 508-517, January 1996. Google ScholarDigital Library
- 4.D. Yu. Grigofiev and A. L. Chistov. Fast decomposition of polynomials into irreducible ones and the solution of systems of algebraic equations. Soviet Math. Dokl., 29(2), 1984.Google Scholar
- 5.A. L. Chistov. Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time. Soviet Mathematics, 34(4): 1838-1882, 1986.Google ScholarCross Ref
- 6.Dima Yu Gfigofiev. Factofizafion of polynomials over a finite field and the solution of systems of algebraic equations. Soviet Mathematics, 34(4): 1762-i 803, 1986.Google Scholar
- 7.Ming-Deh Huang and 'kqu-Chung Wong. Solving systems of polynomial congruences modulo a large prime. In Proceedings of lEEE Symposium on Foundations of Computer Science, pages 115-124, 1996. Google ScholarDigital Library
- 8.Yiu-Chung Wong. Algebraic Set Decomposition, Polynomial Congruences, and Extended Hilbert Irreducibilit3'. PhD thesis, University of Southern California, 1997. Google ScholarDigital Library
- 9.John Canny. The Complerity of Robot Motion Planning. PhD thesis, Massachusetts Institute of Technology, 1988.Google Scholar
- 10.John Canny. Some algebraic and geometric computations in PSPACE. In Proceedings of the 20thACM Symposium on the Theory of Computing, pages 460-467. The Association of Computing Machinery, May 1988. Google ScholarDigital Library
- 11.Douglas John Ierardi. The Complexity of Quantifier Elimination in the Theoo, of an Algebraically Closed Field. PhD thesis, Comell University, 1989.Google Scholar
- 12.Mare Giusti and Loos Heintz. Algofithmesdisons rapides - pour la d6composition d'une vari6t6 alg6bdque en composantes irr6ductibles et 6quidimensionnelles. In Teo Mora and Carlo Traverso, editors, Effective Methods in Algebraic Geometry, volume 94 of Progress in Mathematics, pages 169-194. Birkh{iuser, 1991.Google Scholar
- 13.Mare Giusti and Loos Heintz. La d6termination des points isol6s et de la dimension d'une vari6t6 alg6bfique peut se faire en temps polynomial. In D. Eisenbud and L. Robbiano, editors, ComputationalAlgebraic Geometo' and Commutative Algebra. Cambridge University Press, 1993.Google Scholar
- 14.1. Renegar. On the computational complexity and geometry of the first order theory of the reals, parts iiii. Journal of Symbolie Computation, 13(3):255-352, 1992. Google ScholarDigital Library
- 15.Ming-Deh Huang and Yiu-Chung Wong. Extended hilbert irreducibility and its applications. In Proceedings of the Ninth Annual A CM-$IAM Symposium on Discrete Algorithms, pages 50-58, January 1998. Google ScholarDigital Library
- 16.Pascal Koiran. Randomized and deterministic algorithms for the dimension of algebraic varieties. In Pro. ceedings of lEEE Symposium on Foundations of Computer Science, pages 36-45, 1997. Google Scholar
- 17.Bemd Sturmfels. Sparse elimination theory. In D. Eisenbud and L. Robbiano, editors, Computational Algebraic Geometry and Commutative Algebra, pages 264-298. Cambridge University Press, 1993.Google Scholar
- 18.I. Emifis and J. Canny. A pratical method for the sparse resultant. In Proceedings of ACM International Symposium on Symbolic and Algebraic Computation, Kiev, pages 183-192, 1993. Google ScholarDigital Library
- 19.J.T. Schwartz. Probabilistie algorithms for verification of polynomial identities. Jou,zal ofthe ACbl, 27:701- 717, 1980. Google ScholarDigital Library
- 20.Angel Dfaz and Erich Kaltofen. On computing greatest common divisors with polynomials given by black boxes for their evaluation. In Proe. ISSAC '95, pages 232-239, 1995. Google ScholarDigital Library
- 21.D. Gfigofiev and M. Karpinski. A zero-test and an interpolation algorithm for the shifted sparse polynomials. In Gerard Cohen, Teo Mora, and Oscar Moreno, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, volume 673 of Lecture Notes in Computer Science, pages 162-169. Spfinger-Verlag, Berlin, Germany, 1993. Google ScholarDigital Library
- 22.K. Ffiecll and M. Sudan. Some improvements to lowdegree tests. In Proceedings of the Third Israel Sympo. sium on Theory and Computing Systems, IEEE, 1995, Google ScholarDigital Library
Index Terms
- A black box approach to the algebraic set decomposition problem
Recommendations
A Cloud-Based Black-Box Solar Predictor for Smart Homes
Special Issue on Smart Homes, Buildings and InfrastructuresThe popularity of rooftop solar for homes is rapidly growing. However, accurately forecasting solar generation is critical to fully exploiting the benefits of locally generated solar energy. In this article, we present two machine-learning techniques to ...
Comments