works on
fixed-parameter tractability 1graph algorithms 1graph parameters 1outer k-planar graphs 1parameterized complexity 1

From the 1 of 10 linked papers with an AI index.

collaborators
Showing cs.LOShow all

1 paper · 1 filter

cs.LO2025

On Equivalent Characterizations of the Polynomial Hierarchy in Abstract Models of Computation

Jeremy C. Kirn, Lucas Meijer, Tillmann Miltzow +1

We investigate machine models similar to Turing machines that are augmented with the operations of a first-order structure , and we show that under weak conditions on…