2430 search results - page 232 / 486 » Computing Tutte Polynomials |
164
click to vote
CSR
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
158
click to vote
ATAL
2011
Springer
14 years 4 months ago
2011
Springer
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Thus, coalitional games, including Coalition Structure Generation (CSG), have been ...
128
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility fun...
169
click to vote
AB
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. Symbolic methods for investigating Hopf bifurcation problems of vector fields arising in the context of algebraic biology have recently obtained renewed attention. Howev...
125
click to vote
TGC
2007
Springer
15 years 10 months ago
2007
Springer
Many techniques exist for statically computing properties of the evolution of processes expressed in process algebras. Static analysis has shown how to obtain useful results that c...