Abstract

We show that AΣ 2 L = AΣ k L , k ≥ 2, by proving that AΣ 2 L coincides with AΠ 2 L . Essentially this is done by reducing the AΣ 2 L -complete set (GAP¢CoGap) (ℶ) to the question whether of two vectors A and B of n components, A contains more “solvable” components, i.e., components which are contained in GAP, than B . Moreover, using a similar technique we show AΣ 2 L = L hd (NL) . Finally, we consider the relevance of our proof technique for polynomial time classes, e.g., the Boolean NP -Hierarchy.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.