ting ver- sion which asks if there are least k distinct solutions (and the special case of k = I gives NI'). Again a major open question is whether NP=#1)? Note that a polynomial-time algorithm for a #P-complete problem would be an even bigger result as it would imply both P=NP and P=#1'. The clam P