Fetching the paper…
Reading the bibliography…
The sudoku minimum number of clues problem is the following question: what is the smallest number of clues that a sudoku puzzle can have? For several years it had been conjectured that the answer is 17.
Richard Karp, Reducibility Among Combinatorial Problems , in R. E. Miller, J. W. Thatcher (editors), Complexity of Computer Computations , New York: Plenum, pp. 85–103, 1972
1972
Earlier work this paper cites.
Kenneth Appel, Wolfgang Haken, Every Planar Map is Four Colorable Part I. Discharging , Illinois Journal of Mathematics 21:429–490, 1977
1977
Earlier work this paper cites.
Neil Robertson, Daniel P. Sanders, Paul Seymour, Robin Thomas, The Four-Colour Theorem , J. Combin. Theory Ser. B 70(1): 2–44, DOI:10.1006/jctb.1997.1750, 1997
1997
Earlier work this paper cites.
Ebadollah Mahmoodian, G. H. John van Rees, Critical sets in back-circulant Latin Rectangles , Australasian Journal of Combinatorics 16 (1997), 45–50
1997
Earlier work this paper cites.
Danielle Passos de Ruchkys, Siang Wun Song, A parallel approximation hitting set algorithm for gene expression analysis , in 14th Symposium on Computer Architecture and High Performance Computing , Vitoria, Espirito Santo, Brazil, pp. 75–81, 2002
2002
Earlier work this paper cites.
Rolf Niedermeier, Peter Rossmanith, An efficient fixed-parameter algorithm for 3-Hitting Set , Journal of Discrete Algorithms 1, pp. 89-102, 2003
2003
Earlier work this paper cites.
Thomas C. Hales, A proof of the Kepler conjecture , Annals of Mathematics. Second Series 162 (3): 1065–1185, doi:10.4007/annals.2005.162.1065, 2005
2005
Earlier work this paper cites.
Leonid Khachiyan, Endre Boros, Khaled Elbassioni, Vladimir Gurvich, A New Algorithm for the Hypergraph Transversal Problem , in Computing and Combinatorics, 11th Annual International Conference, COCOON 2005 , LNCS, Vol. 3595, pp. 767–77
2005
Earlier work this paper cites.
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger, Interference in Cellular Networks: The Minimum Membership Set Cover Problem , in Computing and Combinatorics, 11th Annual International Conference, COCOON 2005 , LNCS, Vol. 3595, pp. 188–198
2005
Earlier work this paper cites.
Ed Pegg Jr., Sudoku Variations , Math Games, 2005, http://www.maa.org/editorial/mathgames/mathgames_09_05_05.html
2005
Earlier work this paper cites.
Gary McGuire, Gary McGuire’s Sudoku Page (the original webpage from late 2006), http://www.math.ie/checkerold.html
2006
Cited alongside, same era.
Jean-Paul Delahaye, The Science behind Sudoku , Scientific American, Vol. 294, No. 6, pp. 80–87, 2006
2006
Cited alongside, same era.
Brian Hayes, Unwed Numbers , American Scientist, Vol. 94, No. 1, pp. 12–15, 2006
2006
Cited alongside, same era.
Ed Russell, forum post (MLE for the total number of 17-clue puzzles), January 2006, http://forum.enjoysudoku.com/pseudo-puzzles-t2747.html#p17640
2006
Cited alongside, same era.
Ed Russell, forum post (proof that no 7-clue puzzle exists for 6 × 6 6\times 6
2006
Cited alongside, same era.
Bertram Felgenhauer, Frazer Jarvis, Mathematics of Sudoku I , Mathematical Spectrum, Vol. 39, No. 1, pp. 15–22, 2006
Alexei Vazquez, Optimal drug combinations and minimal hitting sets , BMC Systems Biology 2009, 3:81. doi:10.1186/1752-0509-3-81
2009
Later among the works it cites.
Ed Russell, forum post (determination of the possible automorphism groups), February 2009, http://forum.enjoysudoku.com/about-red-ed-s-sudoku-symmetry-group-t6526-195.html#p66833
2009
Later among the works it cites.
Brian Turner, BBSudoku (bit based sudoku solver), v1.0, October 2009, https://sites.google.com/site/bbsudokufiles/
2009
Later among the works it cites.
Christoph Lass, Sudokus und das 16er Problem , (updated) slides of a talk of Oct. 2010
2010
Later among the works it cites.
Glenn Fowler, forum post (list of all essentially different sudoku solution grids having at least one nontrivial automorphism), June 2010, http://forum.enjoysudoku.com/about-red-ed-s-sudoku-symmetry-group-t6526-195.html#p201053
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
Faisal Abu-Khzam, Kernelization Algorithms for d-Hitting Set Problems , in Proceedings of the 10th Workshop on Algorithms and Data Structures (WADS 2007) , LNCS, Vol. 4619, pp. 434–445
2007
Cited alongside, same era.
Agnes Herzberg, M. Ram Murty, Sudoku Squares and Chromatic Polynomials , Notices of the AMS, Vol. 54, No. 6, pp. 708–717, 2007
2007
Cited alongside, same era.
Laura Taalman, Taking Sudoku Seriously , Math Horizons, Vol. 15, Sept. 2007, pp. 5–9
2007
Cited alongside, same era.
Ed Russell, Frazer Jarvis, Mathematics of Sudoku II , Mathematical Spectrum, Vol. 39, No. 2, pp. 54–58, 2007
2007
Cited alongside, same era.
Drew Mellor, Elena Prieto, Luke Mathieson, Pablo Moscato, A Kernelisation Approach for Multiple d d -Hitting Set and Its Application in Optimal Multi-Drug Therapeutic Combinations , PLoS ONE 5(10): e13055. doi:10.1371/journal.pone.0013055
Cited in the paper.
Gary McGuire, Gary McGuire’s Sudoku Page , http://www.math.ie/checker.html
Cited in the paper.
2010
Later among the works it cites.
Hung-Hsuan Lin, I-Chen Wu, Solving the Minimum Sudoku Problem , TAAI, pp. 456–461, 2010 International Conference on Technologies and Applications of Artificial Intelligence
2010
Later among the works it cites.
Hung-Hsuan Lin, I-Chen Wu, An Efficient Approach To Solving The Minimum Sudoku Problem , ICGA Journal, Vol. 34, No. 4 , pp. 191–208, 2011
2011
Later among the works it cites.
Jason Rosenhouse, Laura Taalman, Taking Sudoku Seriously: The Math Behind the World’s Most Popular Pencil Puzzle , Oxford University Press, USA, 2012
2012
Closest in time.
Christoph Lass, Minimal number of clues for Sudokus , Central European Journal of Computer Science, Volume 2, Issue 2, pp. 143–151, June 2012
2012
Closest in time.