( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF.

, , , , и . LICS, стр. 1-14. IEEE, (2023)

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.

Friedrich

Herbert Friedrich Friedrich

Ralf Friedrich Jeremias

CMOS-Bildsensoren mit Kurzzeitverschluß zur Tiefenerfassung nach dem Lichtlaufzeit-Meßprinzip. Uni Duisburg-Essen, (2009)

Michael Friedrich

Katja Friedrich

 

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

Short Q-Resolution Proofs with Homomorphisms., , и . SAT, том 12178 из Lecture Notes in Computer Science, стр. 412-428. Springer, (2020)Model Counting for CNF Formulas of Bounded Modular Treewidth., , и . Algorithmica, 76 (1): 168-194 (2016)Proof Complexity of Fragments of Long-Distance Q-Resolution., , и . SAT, том 11628 из Lecture Notes in Computer Science, стр. 319-335. Springer, (2019)Dependency Learning for QBF., , и . SAT, том 10491 из Lecture Notes in Computer Science, стр. 298-313. Springer, (2017)Variable Dependencies and Q-Resolution., и . SAT, том 8561 из Lecture Notes in Computer Science, стр. 269-284. Springer, (2014)Computing Resolution-Path Dependencies in Linear Time , ., и . SAT, том 7317 из Lecture Notes in Computer Science, стр. 58-71. Springer, (2012)Polynomial-Time Validation of QCDCL Certificates., , и . SAT, том 10929 из Lecture Notes in Computer Science, стр. 253-269. Springer, (2018)Dataset of Random Reordered Encodings of Parity Problems., , , и . (декабря 2023)Long Distance Q-Resolution with Dependency Schemes., , и . SAT, том 9710 из Lecture Notes in Computer Science, стр. 500-518. Springer, (2016)On Compiling CNFs into Structured Deterministic DNNFs., , , и . SAT, том 9340 из Lecture Notes in Computer Science, стр. 199-214. Springer, (2015)