Skip to main content
SpringerLink
Log in
Book cover

International Meeting of Young Computer Scientists

IMYCS 1990: Aspects and Prospects of Theoretical Computer Science pp 130–137Cite as

Problems complete for ⊕L

  • Part III Communications
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 464))

Abstract

⊕L is the class of languages acceptable by logarithmic space bounded Turing machines that work nondeterministically and are equipped with parity-acceptance, i.e. an input word is accepted if and only if the number of possible correct computation paths on this input is odd. Several natural problems are shown to be complete for ⊕L under NC 1-reductions. A consequence is that ⊕L is the F 2-analogon of Cook's class DET, the class of problems NC 1-reducible to the computation of determinants over Z.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.J. Berkowitz: On computing the determinant in small parallel time using a small number of processors, Information Processing Letters 18(1984), 147–150

    Article  Google Scholar 

  2. A. Borodin,J.v.z. Gathen,J. Hopcroft: Fast parallel matrix and GCD computations, Information and Control 52(1982),241–256

    Article  Google Scholar 

  3. S.A. Cook: A taxonomy of problems with fast parallel algorithms, Information and Control 64(1985), 2–22

    Article  Google Scholar 

  4. C.Damm,Ch.Meinel: Separating completely complexity classes related to polynomial size {⊕}-decision trees, Proc. FCT'89, LNCS 380, 127–136

    Google Scholar 

  5. N.Immermann,D.Landau: The complexity of iterated multiplication, Proc. 4th Structure in Complexity Theory Conference (1989),104–111

    Google Scholar 

  6. M.Krause,Ch.Meinel,S.Waack: Separating the eraser Turing machine classes ℒe,Nℒe, co-Nℒe and P e, Proc. MFCS'88, LNCS 324, 405–413

    Google Scholar 

  7. M.Krause,Ch.Meinel,S.Waack: Separating complexity classes related to certain input oblivious logarithmic space bounded Turing machines, Proc. 4th IEEE Structure in Complexity Theory Symposium, 1989

    Google Scholar 

  8. M.Krause: Separating ⊕L from L, NL, co-NL and AL = P for oblivious Turing machines of linear acces time, to appear in Proc. MFCS'90, Springer Verlag, LNCS??

    Google Scholar 

  9. Ch.Meinel: Polynomial size Ω-branching programs and their computational power, to appear in Information and Computation

    Google Scholar 

  10. K.Mulmuley: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field, Proc. 18th ACM STOC(1986), 338–339

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik, Humboldt-Universität zu Berlin, PO-Box 1297, DDR-1086, Berlin

    Carsten Damm

Authors
  1. Carsten Damm
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jürgen Dassow Jozef Kelemen

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Damm, C. (1990). Problems complete for ⊕L. In: Dassow, J., Kelemen, J. (eds) Aspects and Prospects of Theoretical Computer Science. IMYCS 1990. Lecture Notes in Computer Science, vol 464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53414-8_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-53414-8_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53414-3

  • Online ISBN: 978-3-540-46869-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation