On the constant-depth complexity of k-clique


Conference Paper

We prove a lower bound of ω(nK/4) on the size of constant-depth circuits solving the k-clique problem on n-vertex graphs (for every constant k). This improves a lower bound of ω(nk/59d2) due to Beame where d is the circuit depth. Our lower bound has the advantage that it does not depend on the constant d in the exponent of n, thus breaking the mold of the traditional size-depth tradeoff. Our k-elique lower bound derives from a stronger result of independent interest. Suppose fn : {0, l} n(n/2)→ {0, l} is a sequence of functions computed by constant-depth circuits of size O(nt). Let G be an Erdös-Rényi random graph with vertex set {1, . . . , n} and independent edge probabilities n-a where a ≤ 1/2t-1. Let A be a uniform random k-element subset of {1, . . . , n} (where k is any constant independent of n) and let KA denote the clique supported on A. We prove that fn(G) = fn(G U KA) asymptotically almost surely. These results resolve a long-standing open question in finite model theory (going back at least to Immerman in 1982). The m-variable fragment of first-order logic, denoted by FOm, consists of the first-order sentences which involve at most m variables. Our results imply that the bounded variable hierarchy FO1 ⊂ FO2 ⊂ . . . ⊂ FO m ⊂ . . . is strict in terms of expressive power on finite ordered graphs. It was previously unknown that FO3 is less expressive than full first-order logic on finite ordered graphs. © Copyright 2008 ACM.

Full Text

Duke Authors

Cited Authors

  • Rossman, B

Published Date

  • January 1, 2008

Published In

Start / End Page

  • 721 - 730

International Standard Serial Number (ISSN)

  • 0737-8017

International Standard Book Number 13 (ISBN-13)

  • 9781605580470

Digital Object Identifier (DOI)

  • 10.1145/1374376.1374480

Citation Source

  • Scopus