# Characterizations and approximability of hard counting classes below #P

@article{Bakali2020CharacterizationsAA, title={Characterizations and approximability of hard counting classes below #P}, author={Eleni Bakali and Aggeliki Chalki and Aris Pagourtzis}, journal={ArXiv}, year={2020}, volume={abs/2003.02524} }

An important objective of research in counting complexity is to understand which counting problems are approximable. In this quest, the complexity class TotP, a hard subclass of #P, is of key importance, as it contains self-reducible counting problems with easy decision version, thus eligible to be approximable. Indeed, most problems known so far to admit an fpras fall into this class. An open question raised recently by the community of descriptive complexity is to find a logical… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 26 REFERENCES

## Descriptive Complexity of #P Functions

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Descriptive complexity of approximate counting CSPs

VIEW 1 EXCERPT

## On the relative complexity of approximate counting problems

VIEW 9 EXCERPTS

HIGHLY INFLUENTIAL

## On Approximation Algorithms for #P

VIEW 1 EXCERPT