Structure and Importance of Logspace-MOD-Classes

@inproceedings{Buntrock1991StructureAI,
  title={Structure and Importance of Logspace-MOD-Classes},
  author={Gerhard Buntrock and Carsten Damm and Ulrich Hertrampf and Christoph Meinel},
  booktitle={STACS},
  year={1991}
}
We reene the techniques of Beigel, Gill, Hertrampf 4] who investigated polynomial time counting classes, in order to make them applicable to the case of logarithmic space. We deene the complexity classes MOD k L and demonstrate their signiicance by proving that all standard problems of linear algebra over the nite rings Z/kZ are complete for these classes. We then deene new complexity classes LogFew and LogFewNL and identify them as adequate logspace versions of Few and FewP. We show that… CONTINUE READING

From This Paper

Topics from this paper.
71 Citations
20 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 71 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 20 references

A taxonomy of problems with fast parallel algorithms

  • Stephen A. Cook
  • Information and Control,
  • 1985
Highly Influential
19 Excerpts

Valiant . The relative complexity of checking and evaluating

  • G Leslie
  • Proc . of 15 th MFCS , number 452 in LNCS
  • 1990

Similar Papers

Loading similar papers…