1 citations · 1 across the 3 of their papers we have counts for
5 papers
Short Point Lists for CNFs and Stronger Constant-Depth Circuit Hardness
Xin Li, Yan Zhong
We give a short-description decomposition of bounded-width CNFs. For every fixed , every width- CNF on variables is an exact disjoint union of at most $2^{\va…
Subgraph probabilities in random intersection graphs
Katarzyna Rybarczyk, Grzegorz Serafin
Since their introduction by Karoński, Scheinerman, and Singer-Cohen in 90's, random intersection graphs have attracted much attention, mostly due to their various applications. In…
Normal approximation for subgraph counts in random intersection graphs: the case of edges
Katarzyna Rybarczyk, Grzegorz Serafin
We investigate the subgraph count in the random intersection graph model . Due to substantial edge dependencies, studying even such fundamental statistics is sig…
Explicit bounds for Bell numbers and their ratios
Jerzy Grunwald, Grzegorz Serafin
In this article, we provide a comprehensive analysis of the asymptotic behavior of Bell numbers, enhancing and unifying various results previously dispersed in the literature. We e…
Normal approximation for subgraph count in random hypergraphs
Wojciech Michalczuk, Mikołaj Nieradko, Grzegorz Serafin
A non-uniform and inhomogeneous random hypergraph model is considered, which is a straightforward extension of the celebrated binomial random graph model . We esta…