Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Degree lower bounds of tower-type for approximating formulas with parity quantifiers

Degree lower bounds of tower-type for approximating formulas with parity quantifiers Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers ALBERT ATSERIAS, Universitat Polit` cnica de Catalunya e ANUJ DAWAR, University of Cambridge Kolaitis and Kopparty have shown that for any first-order formula with parity quantifiers over the language of graphs, there is a family of multivariate 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 whose height is 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 the results by Kolaitis and Kopparty that describe the joint distribution of the parities of the numbers of copies of small subgraphs in a random graph to the setting of graphs of growing size. Second, we analyze a variant of Karp's graph canonical labeling algorithm and exploit its massive parallelism to get a formula of low depth http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computational Logic (TOCL) Association for Computing Machinery

Degree lower bounds of tower-type for approximating formulas with parity quantifiers

Loading next page...
 
/lp/association-for-computing-machinery/degree-lower-bounds-of-tower-type-for-approximating-formulas-with-XfniL4yoqQ

References (25)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2014 by ACM Inc.
ISSN
1529-3785
DOI
10.1145/2559948
Publisher site
See Article on Publisher Site

Abstract

Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers ALBERT ATSERIAS, Universitat Polit` cnica de Catalunya e ANUJ DAWAR, University of Cambridge Kolaitis and Kopparty have shown that for any first-order formula with parity quantifiers over the language of graphs, there is a family of multivariate 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 whose height is 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 the results by Kolaitis and Kopparty that describe the joint distribution of the parities of the numbers of copies of small subgraphs in a random graph to the setting of graphs of growing size. Second, we analyze a variant of Karp's graph canonical labeling algorithm and exploit its massive parallelism to get a formula of low depth

Journal

ACM Transactions on Computational Logic (TOCL)Association for Computing Machinery

Published: Feb 1, 2014

There are no references for this article.