Languages that Capture Complexity Classes

@article{Immerman1987LanguagesTC,
  title={Languages that Capture Complexity Classes},
  author={Neil Immerman},
  journal={SIAM J. Comput.},
  year={1987},
  volume={16},
  pages={760-778}
}
We present in this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes For example we show that a property of graphs respectively groups binary strings etc is in polynomial time if and only if it is expressible in the rst order language of graphs respectively groups binary strings etc together with a least xed point operator As another example a property is in logspace if and only if it is expressible in rst… CONTINUE READING
Highly Influential
This paper has highly influenced 36 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.

References

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

Yao,\Separating the Polynomial-Time Hierarchy by Oracles,

  • Andrew Chi-Chih
  • IEEE Symp. on Foundations of Comp. Sci.,
  • 1985

Reducibility By Algebraic Projections," L'Enseignement math ematique

  • L. G. Valiant
  • T. XXVIII,
  • 1982

Similar Papers

Loading similar papers…