Olesia Bilyk, Aidar Munduzbaev, *Roohani Sharma*, and Mamnoon Siam,
Strong Backdoor to Forests is FPT: Tight Linear-Time FPT for Essentially General SAT, 2026.
arxiv.org/abs/2611.12321
Olesia Bilyk, Aidar Munduzbaev, *Roohani Sharma*, and Mamnoon Siam,
Strong Backdoor to Forests is FPT: Tight Linear-Time FPT for Essentially General SAT, 2026.
arxiv.org/abs/2611.12321
#TensorNetworks #QuantumAlgorithms #ZXCalculus
#TensorNetworks #QuantumAlgorithms #ZXCalculus
#טנזור_רשתות #אלגוריתמים_קוונטיים #ZX_Calculus
#טנזור_רשתות #אלגוריתמים_קוונטיים #ZX_Calculus
moralized graph of the DAG, probabilities can be calculated in polynomial time.
moralized graph of the DAG, probabilities can be calculated in polynomial time.
#AI Q: 🧩 Logic or intuition: what solves problems better?
🕸️ Graph Theory | 🧩 Constraint Satisfaction | ⚖️ Logic & Reasoning |
https://bagrounds.org/articles/an-approach-for-systematic-decomposition-of-complex-llm-tasks
#AI Q: 🧩 Logic or intuition: what solves problems better?
🕸️ Graph Theory | 🧩 Constraint Satisfaction | ⚖️ Logic & Reasoning |
https://bagrounds.org/articles/an-approach-for-systematic-decomposition-of-complex-llm-tasks
Metric Dimension is NP-complete on Graphs of Treewidth Two
https://arxiv.org/abs/2610.21133
Metric Dimension is NP-complete on Graphs of Treewidth Two
https://arxiv.org/abs/2610.21133
Parameterized Complexity of Isometric Path Cover: Treewidth and Diameter
https://arxiv.org/abs/2610.22010
Parameterized Complexity of Isometric Path Cover: Treewidth and Diameter
https://arxiv.org/abs/2610.22010
Jan Dreier, Robert Ganian, Marlene Gründel, *Roohani Sharma*, and Simon Wietheger,
Solving SAT via Treewidth Backdoors in Linear Time: Beyond Sparsity, 2026.
arxiv.org/abs/2610.18540
Jan Dreier, Robert Ganian, Marlene Gründel, *Roohani Sharma*, and Simon Wietheger,
Solving SAT via Treewidth Backdoors in Linear Time: Beyond Sparsity, 2026.
arxiv.org/abs/2610.18540
Esther Galby, *Roohani Sharma*, and Bart van der Steenhoven,
Tractability of Hard Digraph Cut Problems on Eulerian Instances: Treewidth Reduction and Reducing CMSO to Unbreakable Eulerian Instances, 2026.
arxiv.org/abs/2610.16869
Esther Galby, *Roohani Sharma*, and Bart van der Steenhoven,
Tractability of Hard Digraph Cut Problems on Eulerian Instances: Treewidth Reduction and Reducing CMSO to Unbreakable Eulerian Instances, 2026.
arxiv.org/abs/2610.16869