- Published 1998 in MFCS
DOI:10.1007/BFb0055798

We study the question of whether every P set has an easy (i.e., polynomialtime computable) census function. We characterize this question in terms of unlikely collapses of language and function classes such as #P1 ⊆ FP, where #P1 is the class of functions that count the witnesses for tally NP sets. We prove that every #P 1 function can be computed in FP #P… (More)

### Presentations referencing similar topics