Sciweavers

1169 search results - page 6 / 234
» Degrees of monotone complexity
Sort
View
CORR
2010
Springer
58views Education» more  CORR 2010»
14 years 10 months ago
Complexity of Non-Monotonic Logics
Michael Thomas, Heribert Vollmer
109
Voted
ICDCS
2002
IEEE
15 years 4 months ago
The Complexity of Adding Failsafe Fault-Tolerance
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
Sandeep S. Kulkarni, Ali Ebnenasir
APAL
2010
85views more  APAL 2010»
14 years 11 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
ICALP
2001
Springer
15 years 4 months ago
Improved Lower Bounds on the Randomized Complexity of Graph Properties
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
Amit Chakrabarti, Subhash Khot