680 search results - page 12 / 136 » Complexity of Strict Implication |
EVOW
2008
Springer
13 years 9 months ago
2008
Springer
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Signi cant eort has been invested recently to accelerate handover operations in a next generation mobile Internet. Corresponding works for developing e cient mobile multicast man...
LICS
1999
IEEE
13 years 12 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
ICCAD
1999
IEEE
13 years 12 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
FSTTCS
2001
Springer
14 years 3 days ago
2001
Springer
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...