Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers

  • Albert Atserias
  • Anuj Dawar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7392)

Abstract

Kolaitis and Kopparty have shown that for any first-order formula with parity quantifiers over the language of graphs there is a family of multi-variate polynomials of constant degree that agree with the formula on all but a 2− Ω(n)-fraction of the graphs with n vertices. The proof bounds the degree of the polynomials by a tower of exponentials in the nesting depth of parity quantifiers in the formula. We show that this tower-type dependence is necessary. We build a family of formulas of depth q whose approximating polynomials must have degree bounded from below by a tower of exponentials of height proportional to q. Our proof has two main parts. First, we adapt and extend known results describing the joint distribution of the parity of the number of copies of small subgraphs on a random graph to the setting of graphs of growing size. Secondly, we analyse a variant of Karp’s graph canonical labeling algorithm and exploit its massive parallelism to get a formula of low depth that defines an almost canonical pre-order on a random graph.

Keywords

Random Graph Atomic Type Label Vertex Boolean Combination Splitting Procedure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Fagin, R.: Probabilities on finite models. J. Symb. Log. 41(1), 50–58 (1976) MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Glebskiĭ, Y.V., Kogan, D.I., Ligon’kiĭ, M., Talanov, V.A.: Range and degree of realizability of formulas in the restricted predicate calculus. Kibernetika 2, 17–28 (1969)Google Scholar
  3. 3.
    Kolaitis, P.G., Vardi, M.Y.: Infinitary logics and 0-1 laws. Information and Computation 98(2), 258–294 (1992)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Dawar, A., Grädel, E.: Properties of almost all graphs and generalized quantifiers. Fundam. Inform. 98(4), 351–372 (2010)MATHGoogle Scholar
  5. 5.
    Compton, K.: 0-1 laws in logic and combinatorics. In: Rival, I. (ed.) NATO Advanced Study Institute on Algorithms and Order, pp. 353–383. Kluwer (1989)Google Scholar
  6. 6.
    Kolaitis, P.G., Kopparty, S.: Random graphs and the parity quantifier. In: STOC 2009: Proc. 41st ACM Symp. Theory of Computing, pp. 705–714 (2009)Google Scholar
  7. 7.
    Allender, E.: A note on the power of threshold circuits. In: FOCS 1989: Proc. 30th Symp. on Foundations of Computer Science, pp. 580–584 (1989)Google Scholar
  8. 8.
    Beigel, R., Tarui, J.: On acc. Computational Complexity 4, 350–366 (1994)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Williams, R.: Non-uniform acc circuit lower bounds. In: Proc. 26th IEEE Conf. Computational Complexity, pp. 115–125 (2011)Google Scholar
  10. 10.
    Razborov, A.A.: Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Math. Notes of the Academy of Sciences of the USSR 41, 333–338 (1987)MathSciNetMATHGoogle Scholar
  11. 11.
    Smolensky, R.: Algebraic methods in the theory of lower bounds for boolean circuit complexity. In: STOC 1987: Proc. 19th ACM Symp. Theory of Computing, pp. 77–82 (1987)Google Scholar
  12. 12.
    Karp, R.M.: Probabilistic analysis of a canonical numbering algorithm for graphs. In: Proceedings of the AMS Symposium in Pure Mathematics, vol. 34, pp. 365–378 (1979)Google Scholar
  13. 13.
    Hella, L., Kolaitis, P.G., Luosto, K.: Almost everywhere equivalence of logics in finite model theory. Bulletin of Symbolic Logic 2, 422–443 (1996)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Albert Atserias
    • 1
  • Anuj Dawar
    • 2
  1. 1.Universitat Politècnica de CatalunyaBarcelonaSpain
  2. 2.University of CambridgeCambridgeUK

Personalised recommendations