Author:
Eickmeyer Kord,Grohe Martin
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference39 articles.
1. Miklos Ajtai and Michael Ben-Or. A theorem on probabilistic constant depth computations. InProceedings of the sixteenth annual ACM symposium on Theory of computing, STOC, pages 471-474, New York, NY, USA, 1984. ACM.
2. Sanjeev Arora and Boaz Barak.Computational Complexity. Cambridge University Press, 2009.
3. On uniformity within NC1
4. J. Barwise and S. Feferman, editors.Model Theoretic Logics. Perspectives in Mathematical Logic. Springer-Verlage, 1985.
5. Christoph Behle and Klaus-Jörn Lange. FO[<]-uniformity. InIEEE Conference on Computational Complexity, pages 183-189, 2006.