• Home
  • Search
  • A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates
  • Cite Icon46
  • https://doi.org/10.1137/s0097539701396959Copy DOI Icon

A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper, we investigate the lower bound on the number of gates in a Boolean circuit that computes the clique function with a limited number of negation gates. To derive strong lower bounds on the size of such a circuit we develop a new approach by combining three approaches: the restriction applied to constant depth circuits due to Hastad, the approximation method applied to monotone circuits due to Razborov, and the boundary covering developed in the present paper. We prove that if a circuit $C$ with at most $\floor{(1/6) \log \log m}$ negation gates detects cliques of size $(\log m)^{3(\log m)^{1/2}}$ in a graph with $m$ vertices, then $C$ contains at least $2^{(1/5)(\log m)^{(\log m)^{1/2}}}$ gates. No nontrivial lower bounds on the size of such circuits were previously known, even if we restrict the number of negation gates to be a constant. Moreover, it follows from a result of Fischer [{\it Lect. Notes Comput. Sci.,} 33 (1974), pp. 71--82] that if one can improve the number of negation gates from $\floor{(1/6)\log\log m}$ to $\floor{2\log m}$ in the statement, then we have P $\neq$ NP. We also show that the problem of lower bounding the negation-limited circuit complexity can be reduced to the one of lower bounding the maximum of the monotone circuit complexity of the functions in a certain class of monotone functions.

Similar Papers
  • Book Chapter
  • Citations4

A superpolynomial lower bound for a circuit computing the clique function with at most (1/6) log log n negation gates

  • Jan 01, 1998
  • Kazuyuki Amano +1
  • Book Chapter

Constant Depth Prefix Circuits With Unbounded Fan-In

  • Sep 08, 1994
  • S Lakshmivarahan +1
  • Research Article

On discretization of some extremal problems

  • Oct 30, 2025
  • Ukrainian Mathematical Bulletin
  • Oleg Kovalenko
  • Research Article
  • Citations31

On the Circuit Complexity of Sigmoid Feedforward Neural Networks

  • Oct 01, 1996
  • Neural Networks
  • Valeriu Beiu +1
  • Book Chapter
  • Citations8

Boolean Circuits and a DNA Algorithm in Membrane Computing

  • Jan 01, 2006
  • Mihai Ionescu +1
  • Book Chapter
  • Citations17

Concrete Multiplicative Complexity of Symmetric Functions

  • Jan 01, 2006
  • Joan Boyar +1
  • Conference Article
  • Citations32

Property Testing Lower Bounds via Communication Complexity

  • Jun 01, 2011
  • Eric Blais +2
  • Research Article
  • Citations68

Minimizing integrals in certain classes of monotone functions

  • Mar 01, 1957
  • Pacific Journal of Mathematics
  • Hugh Brunk +2
  • Research Article
  • Citations185

Property Testing Lower Bounds via Communication Complexity

  • May 30, 2012
  • computational complexity
  • Eric Blais +2
  • Research Article
  • Citations1

Nonlinear differential equations with Caputo fractional derivatives in the class of monotonic functions

  • Oct 01, 2008
  • Computational Mathematics and Modeling
  • H A H Salem
  • Research Article
  • Citations55

Pseudo-Boolean Logic Circuits

  • Jul 01, 1986
  • IEEE Transactions on Computers
  • Hayes
  • Book Chapter
  • Citations13

Key-Policy Attribute-Based Encryption for Boolean Circuits from Bilinear Maps

  • Jan 01, 2015
  • Ferucio Laurenţiu Ţiplea +1
  • Conference Article
  • Citations9

Arithmetic circuits with locally low algebraic rank

  • May 29, 2016
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Mrinal Kumar +1
  • Research Article
  • Citations8

Lower bounds on the area complexity of Boolean circuits

  • Apr 01, 1992
  • Theoretical Computer Science
  • Juraj Hromkovič +4
  • Research Article
  • Citations10

Disproving the Single Level Conjecture

  • Jan 01, 2006
  • SIAM Journal on Computing
  • Stasys Jukna
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.