Arthur D. Chtcherba, Ph.D.
Affiliations: | 2003 | University of New Mexico, Albuquerque, NM, United States |
Area:
Computer Science, MathematicsGoogle:
"Arthur Chtcherba"Parents
Sign in to add mentor| Deepak Kapur | grad student | 2003 | Univ. of New Mexico | |
| (A new Sylvester -type resultant method based on the Dixon-Bezout formulation.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Chtcherba AD, Kapur D, Minimair M. (2009) Cayley-Dixon projection operator for multi-univariate composed polynomials Journal of Symbolic Computation. 44: 972-999 |
| Chtcherba AD, Kapur D. (2006) Conditions for determinantal formula for resultant of a polynomial system Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 2006: 55-62 |
| Chtcherba AD, Kapur D, Minimair M. (2005) Cayley-Dixon resultant matrices of multi-univariate composed polynomials Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3718: 125-137 |
| Chtcherba AD, Kapur D. (2004) Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation Journal of Symbolic Computation. 38: 915-958 |
| Chtcherba AD, Kapur D. (2004) Constructing Sylvester-type resultant matrices using the Dixon formulation Journal of Symbolic Computation. 38: 777-814 |
| Chtcherba AD, Kapur D. (2004) Support hull: Relating the Cayley-Dixon resultant constructions to the support of a polynomial system Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 95-102 |
| Chtcherba AD, Kapur D. (2003) Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation Journal of Symbolic Computation. 36: 289-315 |
| Chtcherba AD, Kapur D. (2002) On the efficiency and optimality of Dixon-based resultant methods Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 29-36 |