In computational complexity theory and computability theory, a counting problem is a type of computational problem. If R is a search problem then isâ€¦Â (More)

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

2011

2011

- Jin-Yi Cai, Pinyan Lu, Mingji Xia
- 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?

2009

2009

- Carla P. Gomes, Ashish Sabharwal, Bart Selman
- Handbook of Satisfiability
- 2009

Propositional model counting or #SAT is the problem of computing the number of models for a given propositional formula, i.eâ€¦Â (More)

Is this relevant?

2004

2004

- Idris Assani, Department, Daniel Mauldin
- 2004

We solve the following counting problem for measure preserving transformations. For f âˆˆ L+(Î¼), is it true that sup n Nn(f)(x) nâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- JÃ¶rg Flum, Martin Grohe
- FOCS
- 2002

We develop a parameterized complexity theory for counting problems. As the basis of this theory, we introduce a hierarchy ofâ€¦Â (More)

Is this relevant?

1998

1998

- Harry B. Hunt, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns
- SIAM J. Comput.
- 1998

We prove the #P-hardness of the counting problems associated with various satisfiability, graph, and combinatorial problems, whenâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Nadia Creignou, Miki Hermann
- 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?

1996

1996

- Maurice Herlihy, Nir Shavit, Orli Waarts
- Distributed Computing
- 1996

The counting problem requires n asynchronous processes to assign themselves successive values. A solution is linearizable if theâ€¦Â (More)

Is this relevant?

1990

1990

- Samir Khuller, Joseph S. B. Mitchell
- Inf. Process. Lett.
- 1990

To obtain efficient algorithms for many computational geometry problems, one needs to solve efficiently the range countingâ€¦Â (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Richard M. Karp, Michael Luby, Neal Madras
- J. Algorithms
- 1989

We develop polynomial time Monte-Carlo algorithms which produce good approximate solutions to enumeration problems for which itâ€¦Â (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- Leslie G. Valiant
- 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?