Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets.
Albert Atserias
,
Iddo Tzameret
Venue
A*
STOC
Year
2025
Proceedings
STOC
DBLP record
conf/stoc/AtseriasT25 ↗
Browse the full
STOC paper archive
.