From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

On the Hierarchical Community Structure of Practical Boolean Formulas.

C. Li, J. Chung, S. Mukherjee, M. Vinyals, N. Fleming, A. Kolokolova, A. Mu, и V. Ganesh. SAT, том 12831 из Lecture Notes in Computer Science, стр. 359-376. Springer, (2021)

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.

Fleming Lampi

Hans Noah

Ingrid Fleming

Kathrin Fleming

Jens Fleming

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

The Proof Complexity of Integer Programming.N. Fleming. University of Toronto, Canada, (2021)TFNP Characterizations of Proof Systems and Monotone Circuits.S. Buss, N. Fleming, и R. Impagliazzo. ITCS, том 251 из LIPIcs, стр. 30:1-30:40. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Stabbing Planes.P. Beame, N. Fleming, R. Impagliazzo, A. Kolokolova, D. Pankratov, T. Pitassi, и R. Robere. ITCS, том 94 из LIPIcs, стр. 10:1-10:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Distribution-Free Testing of Linear Functions on R^n.N. Fleming, и Y. Yoshida. CoRR, (2019)Distribution-Free Testing of Linear Functions on ℝⁿ.N. Fleming, и Y. Yoshida. ITCS, том 151 из LIPIcs, стр. 22:1-22:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Stabbing Planes.P. Beame, N. Fleming, R. Impagliazzo, A. Kolokolova, D. Pankratov, T. Pitassi, и R. Robere. Electron. Colloquium Comput. Complex., (2017)Random CNFs are Hard for Cutting Planes.N. Fleming, D. Pankratov, T. Pitassi, и R. Robere. Electron. Colloquium Comput. Complex., (2017)Semialgebraic Proofs and Efficient Algorithm Design.N. Fleming, P. Kothari, и T. Pitassi. Found. Trends Theor. Comput. Sci., 14 (1-2): 1-221 (2019)Random Θ(log n)-CNFs Are Hard for Cutting Planes.N. Fleming, D. Pankratov, T. Pitassi, и R. Robere. FOCS, стр. 109-120. IEEE Computer Society, (2017)On the Power and Limitations of Branch and Cut.N. Fleming, M. Göös, R. Impagliazzo, T. Pitassi, R. Robere, L. Tan, и A. Wigderson. CCC, том 200 из LIPIcs, стр. 6:1-6:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

BibSonomy

Disambiguation