Modular algorithms for computing Gröbner bases EA Arnold Journal of Symbolic Computation 35 (4), 403-419, 2003 | 180 | 2003 |
Gröbner basis representations of sudoku E Arnold, S Lucas, L Taalman The College Mathematics Journal 41 (2), 101-112, 2010 | 44 | 2010 |
Fast Gr\" obner Basis Computation for Boolean Polynomials F Hinkelmann, E Arnold arXiv preprint arXiv:1010.2669, 2010 | 11 | 2010 |
Minimal complete Shidoku symmetry groups E Arnold, R Field, S Lucas, L Taalman arXiv preprint arXiv:1302.5949, 2013 | 10 | 2013 |
Nest graphs and minimal complete symmetry groups for magic Sudoku variants E Arnold, R Field, J Lorch, S Lucas, L Taalman The Rocky Mountain Journal of Mathematics 45 (3), 887-901, 2015 | 8 | 2015 |
Computing Gröbner bases with Hilbert lucky primes EA Arnold University of Maryland, College Park, 2000 | 3 | 2000 |
Foreword: Bruno Buchberger and the world of Gröbner bases E Arnold, I Kotsireas, M Rosenkranz Journal of Symbolic Computation 46 (5), 495-497, 2011 | 1 | 2011 |
The authors investigate some symmetry groups associated with some variants of 9-by-9 Sudoku boards. Robert F. Bailey E Arnold, R Field, J Lorch, S Lucas, L Taalman Rocky Mountain J. Math 45 (3), 887-901, 2015 | | 2015 |
How Do YOU Solve Sudoku? A Group-theoretic Approach to Human Solving Strategies EA Arnold, HC Chapman, ME Rupert | | |
IMPLEMENTATION OF MODULAR ALGORITHMS FOR COMPUTING GROBNER BASES EA ARNOLD, A BEHN | | |