From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Learning Monotone Decision Trees in Polynomial Time., и . SIAM J. Comput., 37 (3): 827-844 (2007)Sherali-Adams Strikes Back., и . CoRR, (2018)Conditional hardness for satisfiable 3-CSPs., и . STOC, стр. 493-502. ACM, (2009)Spherical cubes: optimal foams from computational hardness amplification., , , и . Commun. ACM, 55 (10): 90-97 (2012)Learning functions of k relevant variables., , и . J. Comput. Syst. Sci., 69 (3): 421-434 (2004)Explicit near-fully X-Ramanujan graphs., и . FOCS, стр. 1045-1056. IEEE, (2020)Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions., , , и . SODA, стр. 1590-1606. SIAM, (2011)Pauli Error Estimation via Population Recovery., и . TQC, том 197 из LIPIcs, стр. 8:1-8:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Quantum Automata Cannot Detect Biased Coins, Even in the Limit., и . ICALP, том 80 из LIPIcs, стр. 15:1-15:8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Polynomial regression under arbitrary product distributions., , и . Mach. Learn., 80 (2-3): 273-294 (2010)