451 search results - page 2 / 91 » Relationless Completeness and Separations |
COCO
2004
Springer
13 years 11 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
ECCC
2002
13 years 5 months ago
2002
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...
POPL
2007
ACM
14 years 5 months ago
2007
ACM
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
COCO
2001
Springer
13 years 10 months ago
2001
Springer
We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is...
ISBI
2002
IEEE
14 years 6 months ago
2002
IEEE
We investigate a new, fast and provably convergentMAP reconstruction algorithm for emission tomography. The new algorithm, termed C-OSEM has its origin in the alternating algorith...