( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Random Θ(log n)-CNFs Are Hard for Cutting Planes.

, , , и . FOCS, стр. 109-120. IEEE Computer Society, (2017)

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.

Oleg Pankratov

Jaap Denissen

Wladimir Denisow

Natalja Denisjuk

Alexander Arnold Denisiuk

 

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

Random CNFs are Hard for Cutting Planes., , , и . CoRR, (2017)Information Lower Bounds via Self-reducibility., , , и . CSR, том 7913 из Lecture Notes in Computer Science, стр. 183-194. Springer, (2013)An Experimental Study of Algorithms for Online Bipartite Matching., , и . ACM J. Exp. Algorithmics, (2020)Stabbing Planes., , , , , , и . Electron. Colloquium Comput. Complex., (2017)Maximum Weight Convex Polytope., , и . CCCG, стр. 257-263. (2022)Advice Complexity of Priority Algorithms., , , и . WAOA, том 11312 из Lecture Notes in Computer Science, стр. 69-86. Springer, (2018)On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem., и . SAT, том 6175 из Lecture Notes in Computer Science, стр. 223-236. Springer, (2010)Advice Complexity of Priority Algorithms., , , и . Theory Comput. Syst., 64 (4): 593-625 (2020)Random Θ(log n)-CNFs Are Hard for Cutting Planes., , , и . FOCS, стр. 109-120. IEEE Computer Society, (2017)On Conceptually Simple Algorithms for Variants of Online Bipartite Matching., , и . WAOA, том 10787 из Lecture Notes in Computer Science, стр. 253-268. Springer, (2017)