Nick Wormald

activity

20122023

most citedThe number of satisfying assignments of random regular k-SAT formulas

4 citations · 7 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2023

Sharper analysis of the random graph $d$ -process via a balls-in-bins model

Andrzej Rucinski, Nick Wormald

A graph $d$ -process starts with an empty graph on $n$ vertices, and adds one edge at each time step, chosen uniformly at random from those pairs which are not yet edges and whose b…

math.CO2016★ 4 cited

The number of satisfying assignments of random regular k-SAT formulas

Amin Coja-Oghlan, Nick Wormald

Let $Φ$ be a random $k$ -SAT formula in which every variable occurs precisely $d$ times positively and $d$ times negatively. Assuming that $k$ is sufficiently large and that $d$ is…

Sharper analysis of the random graph d-process via a balls-in-bins model

The number of satisfying assignments of random regular k-SAT formulas

Sharper analysis of the random graph $d$ -process via a balls-in-bins model