13603 search results - page 207 / 2721 » On the Complexity of Computing Treelength |
113
Voted
IJCAI
2003
15 years 5 months ago
2003
We propose a framework for simple causal theories of action, and study the computational complexity in it of various reasoning tasks such as determinism, progression and regressio...
151
click to vote
IJCAI
1993
15 years 5 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
181
click to vote
PODS
1994
ACM
15 years 8 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
207
click to vote
CCA
2009
Springer
15 years 9 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
138
Voted
CIE
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...