359 search results - page 47 / 72 » The Parameterized Complexity of Counting Problems |
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
CSL
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
JMMA
2010
13 years 2 months ago
2010
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
GMP
2002
IEEE
14 years 16 days ago
2002
IEEE
We present new results on classifying the morphology of the nonsingular intersection curve of two quadrics by studying the roots of the characteristic equation, or the discriminan...
NICSO
2010
Springer
14 years 2 months ago
2010
Springer
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it...