Abstract
The talk is based on a joint work with Dmitry Sokolov. This result improves existing lower bounds on random CNFs using the expansion of an underlying graph of a formula.
The talk is based on a joint work with Dmitry Sokolov. This result improves existing lower bounds on random CNFs using the expansion of an underlying graph of a formula.