Search Sciweavers | Sciweavers

1322 search results - page 20 / 265

» Parameterized counting problems

122

click to vote

APPROX
2000
Springer

84views Algorithms» more APPROX 2000»

On the relative complexity of approximate counting problems

15 years 10 months ago

Download web.maths.unsw.edu.au

Martin E. Dyer, Leslie Ann Goldberg, Catherine S. ...

claim paper

Read More »

134

click to vote

CADE
1994
Springer

161views Logical Reasoning» more CADE 1994»

The Complexity of Counting Problems in Equational Matching

15 years 10 months ago

Download www.lix.polytechnique.fr

Miki Hermann, Phokion G. Kolaitis

claim paper

Read More »

131

click to vote

CP
2008
Springer

73views Artificial Intelligence» more CP 2008»

Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems

15 years 7 months ago

Download www.ics.uci.edu

Lars Otten, Rina Dechter

claim paper

Read More »

112

click to vote

SIAMCOMP
2008

70views more SIAMCOMP 2008»

Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems

15 years 5 months ago

Download www.cs.rit.edu

Ivona Bezáková, Daniel Stefankovic, ...

claim paper

Read More »

112

click to vote

CORR
1998
Springer

75views Education» more CORR 1998»

The Complexity of Planar Counting Problems

15 years 5 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers