The number of k‐SAT functions

DOI10.1002/rsa.10079zbMath1026.68063OpenAlexW2087691816MaRDI QIDQ4805218

Béla Bollobás, Graham R. Brightwell

Publication date: 11 May 2003

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10079

zbMATH Keywords

\(k\)-SAT formulas

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Almost every 2-SAT function is unate ⋮ The number of 2-SAT functions

Cites Work

• Some intersection theorems for ordered sets and graphs
• The number of 2-SAT functions
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• Entropy, independent sets and antichains: A new approach to Dedekind’s problem
• A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph

This page was built for publication: The number of k‐SAT functions