ResearchTrend.AI
Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?

Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?

Markus Hecher
ArXiv (abs)PDFHTML

Papers citing "Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?"

Title
No papers