Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a mathematical proof technique in this 21-minute conference talk that establishes lower bounds for k-DNF resolution on random CNF formulas using expansion methods. Learn about the theoretical foundations of proof complexity as the speaker presents joint research with Dmitry Sokolov, demonstrating how expansion properties can be leveraged to prove computational limitations in logical reasoning systems. Discover the connections between random formula structures and resolution proof lengths, gaining insights into fundamental questions about the efficiency of automated theorem proving and satisfiability solving algorithms.
