The number of 2-SAT functions
From MaRDI portal
Publication:1870908
DOI10.1007/BF02773060zbMATH Open1024.68044OpenAlexW2072137480MaRDI QIDQ1870908FDOQ1870908
Authors: Béla Bollobás, Graham Brightwell, Imre Leader 
Publication date: 20 November 2003
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02773060
Recommendations
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Boolean functions (06E30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic Enumeration of Partial Orders on a Finite Set
- Title not available (Why is that?)
- Projections of Bodies and Hereditary Properties of Hypergraphs
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Some intersection theorems for ordered sets and graphs
- Title not available (Why is that?)
- The average number of linear extensions of a partial order
- Title not available (Why is that?)
- The maximum number of edges in a minimal graph of diameter 2
- The scaling window of the 2-SAT transition
- Title not available (Why is that?)
- Almost all Berge Graphs are Perfect
- The number of k‐SAT functions
Cited In (9)
- An enumerative algorithm for \#2SAT
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Exact enumeration of satisfiable 2-SAT formulae
- On the number of 2-SAT functions
- The number of 3-SAT functions
- The number of k‐SAT functions
- Turán problems for mixed graphs
- Almost every 2-SAT function is unate
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
This page was built for publication: The number of 2-SAT functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870908)
