Result 1 to 8 from 8 total
Computing Gröbner bases of pure binomial ideals via submodules of $\Bbb Z^n$. (English)
J. Symb. Comput. 47, No. 10, 1297-1308 (2012).
1
Gröbner based for submodules of $\Bbb Z^n$. (English)
Rend. Ist. Mat. Univ. Trieste 39, 43-62 (2007).
2
On a familiy of projective toric varieties. (English)
Int. J. Pure Appl. Math. 31, No. 4, 537-553 (2006).
3
Lexicographic Gröbner bases for transportation problems of format $r\times 3\times 3$. (English)
J. Symb. Comput. 41, No. 3-4, 336-356 (2006).
4
Computer algebra for fingerprint matching. (English)
Sloot, Peter M. A. (ed.) et al., Computational science ‒ ICCS 2003. International conference, Melbourne, Australia and St. Petersburg, Russia, June 2‒4, 2003. Proceedings, Part I. Berlin: Springer (ISBN 3-540-40194-6/pbk). Lect. Notes Comput. Sci. 2657, 811-820 (2003).
5
Computer algebra for fingerprint matching (English)
International Conference on Computational Science, 811-820 (2003).
6
Lexicographic Gröbner bases of 3-dimensional transportation problems. (English)
Green, Edward L. (ed.) et al., Symbolic computation: Solving equations in algebra, geometry, and engineering. Proceedings of an AMS-IMS-SIAM joint summer research conference, Mount Holyoke College, South Hadley, MA, USA, June 11-15, 2000. Providence, RI: AMS, American Mathematical Society. Contemp. Math. 286, 145-168 (2001).
7
Syzygies of determinantal varieties. (Italian)
Semin. Geom., Univ. Studi Bologna 1987-1988, 41-54 (1988).
8
Result 1 to 8 from 8 total
Start
Contact
Print
General Help
