Arthur D. Chtcherba, Ph.D. - Publications

Affiliations: 
2003 University of New Mexico, Albuquerque, NM, United States 
Area:
Computer Science, Mathematics

8 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2009 Chtcherba AD, Kapur D, Minimair M. Cayley-Dixon projection operator for multi-univariate composed polynomials Journal of Symbolic Computation. 44: 972-999. DOI: 10.1016/J.Jsc.2008.07.007  0.652
2006 Chtcherba AD, Kapur D. Conditions for determinantal formula for resultant of a polynomial system Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 2006: 55-62.  0.669
2005 Chtcherba AD, Kapur D, Minimair M. 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. DOI: 10.1007/11555964_11  0.636
2004 Chtcherba AD, Kapur D. Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation Journal of Symbolic Computation. 38: 915-958. DOI: 10.1016/J.Jsc.2003.12.001  0.694
2004 Chtcherba AD, Kapur D. Constructing Sylvester-type resultant matrices using the Dixon formulation Journal of Symbolic Computation. 38: 777-814. DOI: 10.1016/J.Jsc.2003.11.003  0.689
2004 Chtcherba AD, Kapur D. 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.  0.675
2003 Chtcherba AD, Kapur D. Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation Journal of Symbolic Computation. 36: 289-315. DOI: 10.1016/S0747-7171(03)00084-1  0.634
2002 Chtcherba AD, Kapur D. On the efficiency and optimality of Dixon-based resultant methods Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 29-36.  0.63
Show low-probability matches.