( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard.

, и . CoRR, (2020)

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.

Kurt Hecher

Birgit Hecher

Christine Hecher

Markus Markus

Markus Kurscheidt

Ökonomische Analyse von Sportgroßveranstaltungen: ein integrierter Evaluierungs- und Management-Ansatz am Beispiel von Fußball-Weltmeisterschaften. Uni Paderborn, (2007)
 

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

Exploiting Database Management Systems and Treewidth for Counting., , , и . PADL, том 12007 из Lecture Notes in Computer Science, стр. 151-167. Springer, (2020)The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)., , и . IPEC, том 148 из LIPIcs, стр. 25:1-25:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Advanced tools and methods for treewidth-based problem solving.. it Inf. Technol., 65 (1-2): 65-74 (мая 2023)Treewidth and Counting Projected Answer Sets., и . LPNMR, том 11481 из Lecture Notes in Computer Science, стр. 105-119. Springer, (2019)Answer Set Solving with Bounded Treewidth Revisited., , , и . LPNMR, том 10377 из Lecture Notes in Computer Science, стр. 132-145. Springer, (2017)Lower Bounds for QBFs of Bounded Treewidth., , и . LICS, стр. 410-424. ACM, (2020)Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?. AAAI, стр. 6407-6415. AAAI Press, (2023)Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?, и . CoRR, (2024)IASCAR: Incremental Answer Set Counting by Anytime Refinement., , , и . CoRR, (2023)Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard., и . CoRR, (2020)