# Counting problem (complexity)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- SIAM J. Comput.
- 2011

We propose and explore a novel alternative framework to study the complexity of counting problems, called Holant problems… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- SIAM J. Comput.
- 2004

We develop a parameterized complexity theory for counting p roblems. As the basis of this theory, we introduce a hierarchy of… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Algorithmica
- 2003

Two natural classes of counting problems that are interreducible under approximation-preserving reductions are: (i) those that… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- SIAM J. Comput.
- 2001

We show that a number of graph-theoretic counting problems remain NP-hard, indeed #P-complete, in very restricted classes of… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- SIAM J. Comput.
- 1998

Le thème de cet article est l’étude de problèmes classiques “difficiles” à différents degrés, liés à 3SAT ou concernant des… (More)

Is this relevant?

1997

1997

- MFCS
- 1997

In this paper we introduce a complexity theoretic notion of counting problems over the real numbers. We follow the approaches of… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Inf. Comput.
- 1996

The class of generalized satisfiability problems, introduced in 1978 by Schaefer, presents a uniform way of studying the… (More)

Is this relevant?

Highly Cited

1983

Highly Cited

1983

- STOC
- 1983

There are several computational problems that can be formulated as problems of counting the number of objects having a certain… (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- Inf. Process. Lett.
- 1979

The objective of this note is to show that the problem of recognizing whether or not two graphs are isomorphic and the problem of… (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- Theor. Comput. Sci.
- 1979

where the summation is over the n! permutations of (1,2, . . . , n). It is the same as the determinant except that all the terms… (More)

Is this relevant?