Negation-limited formulas

Siyao Guo, Ilan Komargodski

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We give an efficient structural decomposition theorem for formulas that depends on their negation complexity and demonstrate its power with the following applications: We prove that every formula that contains t negation gates can be shrunk using a random restriction to a formula of size O(t) with the shrinkage exponent of monotone formulas. As a result, the shrinkage exponent of formulas that contain a constant number of negation gates is equal to the shrinkage exponent of monotone formulas. We give an efficient transformation of formulas with t negation gates to circuits with log t negation gates. This transformation provides a generic way to cast results for negation-limited circuits to the setting of negation-limited formulas. For example, using a result of Rossman ([33]), we obtain an average-case lower bound for formulas of polynomial-size on n variables with n1/2-∈ negations. In addition, we prove a lower bound on the number of negations required to compute one-way permutations by polynomial-size formulas.

Original languageEnglish
Title of host publicationApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 18th International Workshop, APPROX 2015, and 19th International Workshop, RANDOM 2015
EditorsNaveen Garg, Klaus Jansen, Anup Rao, Jose D. P. Rolim
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages850-866
Number of pages17
ISBN (Electronic)9783939897897
DOIs
StatePublished - 1 Aug 2015
Externally publishedYes
Event18th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2015, and 19th International Workshop on Randomization and Computation, RANDOM 2015 - Princeton, United States
Duration: 24 Aug 201526 Aug 2015

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume40

Conference

Conference18th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2015, and 19th International Workshop on Randomization and Computation, RANDOM 2015
Country/TerritoryUnited States
CityPrinceton
Period24/08/1526/08/15

Keywords

  • De Morgan formulas
  • Negation complexity
  • Shrinkage

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'Negation-limited formulas'. Together they form a unique fingerprint.

Cite this