Skip to content

Faster Satisfiability Algorithms for Systems of Polynomial Equations over Finite Fields and ACC^0[p]

About this video

Advanced · Editorial review

Simons Institute for the Theory of Computing is already on Lumen; this upload was never considered before. Channel treated as academic (strict check, default pass); title passed a strict per-title check; oEmbed verified.

Video by Simons Institute for the Theory of Computing, played through YouTube's embedded player.