359 search results - page 13 / 72 » The Parameterized Complexity of Counting Problems |
DAC
1999
ACM
13 years 12 months ago
1999
ACM
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
ALGOSENSORS
2008
Springer
13 years 9 months ago
2008
Springer
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
CC
2006
Springer
13 years 7 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
CP
2009
Springer
14 years 8 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...