These are the sources and citations used to research Database Complexity. This bibliography was generated on Cite This For Me on
In-text: (Codd, 1970)
Your Bibliography: Codd, E. (1970). A relational model of data for large shared data banks. Communications of the ACM, 13(6), pp.377-387.
In-text: (Grohe, 2011)
Your Bibliography: Grohe, M. (2011). From polynomial time queries to graph structure theory. Communications of the ACM, 54(6), p.104.
In-text: (Sanjeev Arora. Boaz Barak., 2009)
Your Bibliography: Sanjeev Arora. Boaz Barak. (2009). Computational Complexity: A Modern Approach. Cambridge University Press.
In-text: (Chandra and Harel, 1982)
Your Bibliography: Chandra, A. and Harel, D. (1982). Structure and complexity of relational queries. Journal of Computer and System Sciences, 25(1), pp.99-128.
In-text: (Gurevich, 1988)
Your Bibliography: Gurevich, Y. (1988). Logic and the challenge of computer science. Current Trends in Theoretical Computer Science, (Computer Science Press), pp.1-57.
In-text: (Vardi, 1982)
Your Bibliography: Vardi, M. (1982). The complexity of relational query languages. Proceedings of the 14th ACm Symposium on Theory of Computing, pp.137-146.
In-text: (Why we do isomorphism, 2018)
Your Bibliography: Why we do isomorphism, a. (2018). Why we do isomorphism, automorphism and homomorphism?. [online] Cs.stackexchange.com. Available at: https://cs.stackexchange.com/questions/7690/why-we-do-isomorphism-automorphism-and-homomorphism [Accessed 9 Feb. 2018].
In-text: (Fagin, 1974)
Your Bibliography: Fagin, R. (1974). Generalized first-order spectra and polynomial-time recognisable sets. Complexity of Computation, 7, pp.43-73.
In-text: (Dawar, 2003)
Your Bibliography: Dawar, A. (2003). Fixed-Point Logics and Computation.
10,587 students joined last month!