314 search results - page 16 / 63 » Complete Problems for Dynamic Complexity Classes |
EOR
2008
14 years 9 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
ECOOP
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We are interested in the class of systems for which the satisfaction of code dependencies is a dynamic process rather than one which is determined purely at load-time. Ex...
85
Voted
AAAI
2006
14 years 11 months ago
2006
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
FUIN
2007
14 years 9 months ago
2007
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...