Sciweavers

ECCC
2002
68views more  ECCC 2002»
13 years 4 months ago
Bi-Immunity Separates Strong NP-Completeness Notions
We prove that if for some > 0, NP contains a set that is DTIME(2n )-bi-immune, then NP contains a set that is 2-Turing complete for NP (hence 3-truth-table complete) but not 1-t...
Aduri Pavan, Alan L. Selman
ENTCS
2006
141views more  ENTCS 2006»
13 years 4 months ago
Verification of Distributed Hierarchical Components
Components allow to design applications in a modular way by enforcing a strong separation of concerns. In distributed systems this separation of concerns have to be composed with ...
Tomás Barros, Ludovic Henrio, Eric Madelain...