281 search results - page 35 / 57 » The Complexity of Planar Counting Problems |
FOCM
2007
13 years 7 months ago
2007
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...
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...
22
Voted
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...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
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...