( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution.

, , , и . ACM Trans. Comput. Log., 24 (2): 10:1-10:30 (апреля 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.

Tomás Núñez

Tomás Vinar

Ana Teresa Monteiro Tomás

Tomás Barros

Tomás Mácha

 

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

Long Distance Q-Resolution with Dependency Schemes., , и . SAT, том 9710 из Lecture Notes in Computer Science, стр. 500-518. Springer, (2016)Finding the Hardest Formulas for Resolution., и . J. Artif. Intell. Res., (2021)Long-Distance Q-Resolution with Dependency Schemes., , и . J. Autom. Reason., 63 (1): 127-155 (2019)Should Decisions in QCDCL Follow Prefix Order?, , и . SAT, том 236 из LIPIcs, стр. 11:1-11:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture., , и . SAT, том 271 из LIPIcs, стр. 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Fixed-Parameter Tractability of Dependency QBF with Structural Parameters., , , и . KR, стр. 392-402. (2020)Finding the Hardest Formulas for Resolution., и . CP, том 12333 из Lecture Notes in Computer Science, стр. 514-530. Springer, (2020)Hardness Characterisations and Size-width Lower Bounds for QBF Resolution., , , и . ACM Trans. Comput. Log., 24 (2): 10:1-10:30 (апреля 2023)Proof Complexity of Fragments of Long-Distance Q-Resolution., , и . SAT, том 11628 из Lecture Notes in Computer Science, стр. 319-335. Springer, (2019)Are hitting formulas hard for resolution?, и . Discret. Appl. Math., (октября 2023)