Key points are not available for this paper at this time.
The class of # P-complete problems is a class of computationally eqivalent counting problems (defined by the author in a previous paper) that are at least as difficult as the NP-complete problems. Here we show, for a large number of natural counting problems for which there was no previous indication of intractability, that they belong to this class. The technique used is that of polynomial time reduction with oracles via translations that are of algebraic or arithmetic nature.
Leslie G. Valiant (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: