3897 search results - page 239 / 780 » complexity 2010 |
170
click to vote
ENTCS
2007
15 years 6 months ago
2007
Several model-checker based methods to automated test-case generation have been proposed recently. The performance and applicability largely depends on the complexity of the model...
152
click to vote
ENTCS
2000
15 years 6 months ago
2000
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
183
click to vote
ENTCS
2002
15 years 6 months ago
2002
The perceived advantages of distributed systems, such as increased reliability and availability, are o set by the increased complexity of developing such applications. The develop...
145
click to vote
ENTCS
2002
15 years 6 months ago
2002
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
180
click to vote
ECCC
2010
15 years 5 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...