Collapsing degrees via strong computation
نویسندگان
چکیده
منابع مشابه
Collapsing Degrees via Strong Computation
Though Berman and others have provided powerful techniques to collapse nondeterministic degrees at and above nondeterministic linear space, and Immerman and Szelepcsenyi have provided techniques that collapse even sublinear nondeterministic space classes, it has remained an open problem whether any collapses could be proven for sublinear nondeterministic space degrees. This paper provides the f...
متن کاملCollapsing Polynomial-Time Degrees
For reducibilities r and r′ such that r is weaker than r′, we say that the r-degree of A, i.e., the class of sets which are r-equivalent to A, collapses to the r′-degree of A if both degrees coincide. We investigate for the polynomial-time bounded many-one, bounded truth-table, truth-table, and Turing reducibilities whether and under which conditions such collapses can occur. While we show that...
متن کاملFault Collapsing via Functional Dominance
A fault fj is said to dominate another fault fi if all tests for fi detect fj . When two faults dominate each other, they are called equivalent. Dominance and equivalence relations among faults around a Boolean gate are called \structural" and are used for fault collapsing in large circuits. Some fault equivalences, that cannot be determined by the structural analysis, can be found by \function...
متن کاملConcave Minimization Via Collapsing Polytopes
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. INFORMS is collaborating with JSTOR to digitize, preserve ...
متن کاملHeterogeneous Strong Computation Migration
The continuous increase in performance requirements, for both scientific computation and industry, motivates the need of a powerful computing infrastructure. The Grid appeared as a solution for inexpensive execution of heavy applications in a parallel and distributed manner. It allows combining resources independently of their physical location and architecture to form a global resource pool av...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1993
ISSN: 0022-0000
DOI: 10.1016/0022-0000(93)90009-l