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

Kazuyuki Amano, Akira Maruoka. A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log ::::n:::: Negation Gates. SIAM Journal on Computing, 35(1):201-216, 2005. [doi]

@article{AmanoM05:0,
  title = {A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log ::::n:::: Negation Gates},
  author = {Kazuyuki Amano and Akira Maruoka},
  year = {2005},
  url = {http://epubs.siam.org/SICOMP/volume-35/art_39695.html},
  researchr = {https://researchr.org/publication/AmanoM05%3A0},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {35},
  number = {1},
  pages = {201-216},
}