Author:
Bollobás Béla,Brightwell Graham R.,Leader Imre
Publisher
Springer Science and Business Media LLC
Reference16 articles.
1. B. Aspvall, M. F. Plass and R. E. Tarjan,A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Information Processing Letters8 (1979), 121–123.
2. B. Bollobás,Modern Graph Theorys, Springer-Verlag, Berlin, 1998, xiii+394pp.
3. B. Bollobás, C. Borgs, J. T. Chayes, J. H. Kim and D. B. Wilson,The scaling window of the 2-SAT transition, Random Structures and Algorithms18 (2001), 201–256.
4. B. Bollobás and G. R. Brightwell,The number of k-SAT functions, submitted for publication. (Available as CDAM Research Report LSE-CDAM-2001-11, London School of Economics.)
5. B. Bollobás and A. Thomason,Projections of bodies and hereditary properties of hypergraphs, Journal of the London Mathematical Society27 (1995), 417–424.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Turán problems for mixed graphs;Journal of Combinatorial Theory, Series B;2024-07
2. Nearly All -SAT Functions Are Unate;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. The number of 3-SAT functions;Israel Journal of Mathematics;2012-05-12
4. On the Number of 2-SAT Functions;Combinatorics, Probability and Computing;2009-09
5. Almost every 2-SAT function is unate;Israel Journal of Mathematics;2007-10