𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Isomorphisms and 1-L reductions

✍ Scribed by Eric W. Allender


Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
854 KB
Volume
36
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Reductions to Graph Isomorphism
✍ Jacobo TorΓ‘n πŸ“‚ Article πŸ“… 2008 πŸ› Springer 🌐 English βš– 382 KB
Polynomial-Time Isomorphism of 1-L-Compl
✍ Manindra Agrawal; Somenath Biswas πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 322 KB

Let C be any complexity class closed under log-lin reductions. We show that all sets complete for C under 1-L reductions are polynomialtime isomorphic to each other. We also generalize the result to reductions computed by finite-crossing machines. As a corollary, we show that all sets complete for C