| Eric Allender, "Isomorphisms and 1-L Reductions," J. Computer Sys. Sci. 36 (1988), 336-350. |
....a very restricted class of isomorphisms. This result is incomparable to a very recent result of [AB] showing that all sets complete under one way logspace reductions (1 L reductions) are isomorphic under polynomial time computable isomorphisms. This work of [AB] improves an earlier result of [A88]. Note that it is easy to prove that the class of 1 L reductions is incomparable with the class of first order projections. Other interesting results concerning 1 L reductions may be found in [BH90, HH] 4 3 Descriptive Complexity In this section we recall the notation of Descriptive ....
Eric Allender, "Isomorphisms and 1-L Reductions," J. Computer Sys. Sci. 36 (1988), 336-350.
....under a very restricted class of isomorphisms. This result is incomparable to a recent result of [AB] showing that all sets complete under one way logspace reductions (1 L reductions) are isomorphic under polynomial time computable isomorphisms. This work of [AB] improves an earlier result of [A88]. Note that it is easy to prove that the class of 1 L reductions is incomparable with the class of first order projections. Other interesting results concerning 1 L reductions may be found in [BH90, HH] 3 Descriptive Complexity In this section we recall the notation of Descriptive Complexity ....
Eric Allender, "Isomorphisms and 1-L Reductions," J. Computer Sys. Sci. 36 (1988), 336-350.
No context found.
Eric Allender (1988), Isomorphisms and 1-L Reductions, J. Computer Sys. Sci. 36, 336-350.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC