( en | de | ru )

 

Disambiguation of "Hatami, Hamed"

Author of the publication

copydeleteadd this publication to your clipboard
Trading information complexity for error.

, , , and . Electron. Colloquium Comput. Complex., (2016)

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. You can also use the button next to the name to display some publications already assigned to the person.

Fariba Hatami

Isaak Hatami

Naser Hatami

Davar Hatami

Rasi Hatami

 

Other publications of authors with the same name

Correlation testing for affine invariant properties on Fpn in the high error regime., and . Electron. Colloquium Comput. Complex., (2011)Higher-order Fourier analysis of Fpn and the complexity of systems of linear forms., and . Electron. Colloquium Comput. Complex., (2010)Approximation algorithms for hitting subgraphs., , , , and . CoRR, (2020)Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l1 Embeddability of Negative Type Metrics., , and . APPROX-RANDOM, volume 4627 of Lecture Notes in Computer Science, page 164-179. Springer, (2007)Lower Bound Methods for Sign-Rank and Their Limitations., , , , and . APPROX/RANDOM, volume 245 of LIPIcs, page 22:1-22:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Approximation Algorithms for Hitting Subgraphs., , , , and . IWOCA, volume 12757 of Lecture Notes in Computer Science, page 370-384. Springer, (2021)Random cubic graphs are not homomorphic to the cycle of size 7.. J. Comb. Theory B, 93 (2): 319-325 (2005)The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three., and . SIAM J. Discret. Math., 23 (4): 1762-1775 (2009)The Implicit Graph Conjecture is False., and . FOCS, page 1134-1137. IEEE, (2022)Higher-order Fourier Analysis and Applications., , and . Found. Trends Theor. Comput. Sci., 13 (4): 247-448 (2019)