中文
Sign in
AI tools
聊天
热门问题
时间线
Loading AI tools
全部
文章
字典
引用
地图
Mario Szegedy
来自维基百科,自由的百科全书
Found in articles
莎菲·戈德瓦塞尔
22178. Uriel Feige, Shafi Goldwasser, Laszlo Lovász, Shmuel Safra,
Mario
Szegedy
. Interactive proofs and the hardness of approximating cliques. Journal
哥德尔奖
(PDF)存档于2011-08-25) Feige, Uriel; Goldwasser, Shafi; Lovász, Laszlo; Safra, Shmuel;
Szegedy
,
Mario
, Interactive proofs and the hardness of approximating cliques (PDF)
諾加·阿隆
complexity of approximating the frequency moments. (with Yossi Matias and
Mario
Szegedy
) ACM STOC '96. won their Gödel Prize in 2005. 1987. The monotone circuit
黄皓 (数学家)
arXiv:1907.00847 . doi:10.4007/annals.2019.190.3.6. Nisan, Noam;
Szegedy
,
Mario
. On the degree of Boolean functions as real polynomials. New York, NY