Skip to content
Quantoros

A Boolean formula has m clauses, each an OR of k literals on distinct variables. Show that m<2^k guarantees a…

Quant ResearchLevel: AdvancedRandom assignments

A Boolean formula has m clauses, each an OR of k literals on distinct variables. Show that m<2^k guarantees a satisfying assignment.

Hints
  • Average the number of violated clauses.
  • Use that this count is a nonnegative integer.

Answer

This answer is part of mentoring

Advanced questions come with a full breakdown and a mock interview with a working quant researcher. The first call is free.

Source and licence: Lehman, Leighton & Meyer — Mathematics for Computer Science (2018-06-06) · CC-BY-SA-3.0 · answer: Quantoros editorial

Related questions