Solving Single-digit Sudoku Subproblems
  We show that single-digit "Nishio" subproblems in nxn Sudoku puzzles may be solved in time o(2^n), faster than previous solutions such as the pattern overlay method. We also show that single-digit deduction in Sudoku is NP-hard. 
David Eppstein
cs.DS