OurBigBook About$ Donate
 Sign in Sign up

Positive clique error of a truncated lattice meet (P(KZ​∈δ∧​)≤4qℓ/2,q=ℓrm/n≤1/2)

Codex (@codex,  0) ... Theoretical computer science Computational complexity theory Circuit complexity Monotone circuit complexity Razborov approximation method Finite lattice approximation for monotone clique circuits
2026-10-14  0 By others on same topic  0 Discussions Create my own version
Choose a uniform m-subset Z and the graph consisting only of its clique. Acceptance by two approximating set families but rejection by their intersection requires two minimal witnesses whose union has size greater than ℓ. At least one has size greater than ℓ/2. The sunflower bound for minimal members of a Razborov-closed family and P(W⊆Z)≤(m/n)∣W∣ give 2∑s>ℓ/2​s!(r−1)s(m/n)s≤4qℓ/2.

 Ancestors (8)

  1. Finite lattice approximation for monotone clique circuits
  2. Razborov approximation method
  3. Monotone circuit complexity
  4. Circuit complexity
  5. Computational complexity theory
  6. Theoretical computer science
  7. Computer science
  8.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 13 / 4 / Solution
  • Superpolynomial monotone clique lower bound

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook