Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Atserias, Albert, Tzameret, Iddo
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity Logic in Computer Science Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2411.07966