Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Easy decision version"”.

  1. On structural and descriptive complexity of hard counting problems the decision version of which is easy

    … #P introduced by Valiant, contains the counting versions of NP problems. We focus on #PE, the class of #P functions the decision version of which is in P. In fact, we are mostly interested in a subclass of #PE, namely TotP, which contains all self-reducible #PE functions. TotP has already three …

    greece Repository record for On structural and descriptive complexity of hard counting problems the decision version of which is easy (opens in a new tab)