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.

 

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

Improving PPSZ for 3-SAT using Crtitical Variables, , и . CoRR, (2010)Unsatisfiable Linear CNF Formulas Are Large, and Difficult to Construct Explicitely. CoRR, (2009)PPSZ on CSP Instances with Multiple Solutions.. Electron. Colloquium Comput. Complex., (2018)PPSZ for k ≥ 5: More Is Better.. Electron. Colloquium Comput. Complex., (2018)How Many Conflicts Does It Need to Be Unsatisfiable?, и . SAT, том 4996 из Lecture Notes in Computer Science, стр. 246-256. Springer, (2008)Unsatisfiable CNF Formulas contain Many Conflicts.. ISAAC, том 8283 из Lecture Notes in Computer Science, стр. 273-283. Springer, (2013)Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas.. ISAAC, том 8283 из Lecture Notes in Computer Science, стр. 251-261. Springer, (2013)Overlays and Limited Memory Communication., , и . CCC, стр. 298-308. IEEE Computer Society, (2014)Recent studies of agent incentives in internet resource allocation and pricing., , и . Ann. Oper. Res., 314 (1): 49-76 (2022)Derandomization of \(k\) -SAT Algorithm.. Encyclopedia of Algorithms, (2016)