3 papers
cs.DS2026
Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
David Mestel, Steven Chaplick, Steven Kelk +1
Phylogenetic trees are leaf-labelled trees used to model the evolution of species. In practice it is not uncommon to obtain two topologically distinct trees for the same set of spe…
quant-ph2026
Product-State Approximation Algorithms for the Transverse Field Ising Model
Vincenzo Lipardi, David Mestel, Georgios Stamoulis
We study classical polynomial-time approximation algorithms for the transverse-field Ising model (TFIM) Hamiltonian, allowing a mixture of ferromagnetic and anti-ferromagnetic inte…
cs.LO2024
The Decision Problem for Regular First-Order Theories
Umang Mathur, David Mestel, Mahesh Viswanathan
The \emph{Entscheidungsproblem}, or the classical decision problem, asks whether a given formula of first-order logic is satisfiable. In this work, we consider an extension of this…