The number of 3-SAT functions

Details The number of 3-SAT functions The number of 3-SAT functions

2010-05-12

arxiv.org/abs/1005.2861v1

Mathematics

Combinatorics

51 pages

Scientific paper

With $G_k(n)$ the number of functions of $n$ boolean variables definable by
$k$-SAT formulae, we prove that $G_3(n)$ is asymptotic to $2^{n+\binom{n}{3}}$.
This is a strong form of the case $k=3$ of a conjecture of Bollob\'as,
Brightwell and Leader stating that for fixed $k$, $\log_2 G_k(n)\sim
\binom{n}{k}$.

Affiliated with

Also associated with

No associations

Rating

The number of 3-SAT functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The number of 3-SAT functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The number of 3-SAT functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-500820