13603 search results - page 285 / 2721 » On the Complexity of Computing Treelength |
156
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
171
click to vote
IJFCS
2008
15 years 6 months ago
2008
The conventional forbidden state problem for discrete event systems is concerned with the issue of synthesizing a maximally permissive control policy to prevent a discrete event s...
176
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
174
click to vote
ISAAC
2009
Springer
16 years 19 days ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
162
click to vote
ICECCS
2000
IEEE
15 years 10 months ago
2000
IEEE
Complexity arises from many sources – both within and outwith the system. Internal sources include modern hardware, e.g. super-scalar processors, and external sources include th...