
本文提出了一個新的 Schwartz-Zippel 引理證明，該證明不僅提供了對多變量多項式根的有效編碼，還證明了在有限域中尋找擊中集問題的複雜性與雙重弱鴿巢原理等價。


coremsg

schwartz-zippel-引理的可行構造性證明及其在尋找擊中集的複雜性應用


Schwartz-Zippel 引理的可行構造性證明及其在尋找擊中集的複雜性應用


title_rewrite


This paper presents a novel, feasibly constructive proof of the Schwartz-Zippel Lemma within the framework of bounded arithmetic, demonstrating its implications for the existence and complexity of finding hitting sets for polynomial identity testing (PIT).


a-new-feasibly-constructive-proof-of-the-schwartz-zippel-lemma-and-its-implications-for-finding-hitting-sets


A New, Feasibly Constructive Proof of the Schwartz-Zippel Lemma and its Implications for Finding Hitting Sets
