( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Enumerating k-SAT functions.

, , и . SODA, стр. 2141-2184. SIAM, (2022)

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.

Anjana Nityanandam

Maheswaran Mani

Mani Dabui

Helen Mani

Peter Mani

 

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

Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming., , , , , и . SIAM J. Discret. Math., 35 (3): 1557-1568 (2021)Strong Spatial Mixing for Colorings on Trees and its Algorithmic Applications., , , и . FOCS, стр. 810-845. IEEE, (2023)Nearly all k-SAT functions are unate., , , , и . CoRR, (2022)Enumerating k-SAT functions., , и . SODA, стр. 2141-2184. SIAM, (2022)Making an H $H$ -free graph k $k$ -colorable., , и . J. Graph Theory, 102 (2): 234-261 (2023)From Algorithms to Connectivity and Back: Finding a Giant Component in Random k-SAT., и . SODA, стр. 3437-3470. SIAM, (2023)Lower bounds for Max-Cut in $H$-free graphs via semidefinite programming, , , , , и . (2018)cite arxiv:1810.10044Comment: 21 pages, to be published in LATIN 2020 proceedings, Updated version is rewritten to include additional results along with corrections to original arguments.An Interpretable Approach to Hateful Meme Detection., и . ICMI, стр. 723-727. ACM, (2021)Nearly All k-SAT Functions Are Unate., , , , и . STOC, стр. 958-962. ACM, (2023)Lower Bounds for Max-Cut via Semidefinite Programming., , , , , и . LATIN, том 12118 из Lecture Notes in Computer Science, стр. 479-490. Springer, (2020)