14 citations · 26 across the 10 of their papers we have counts for
4 papers · 1 filter
Strong Structural Bounds for MaxSAT: The Fine Details of Using Neuromorphic and Quantum Hardware Accelerators
Max Bannach, Jai Grover, Markus Hecher
Hardware accelerators like quantum annealers or neuromorphic chips are capable of finding the ground state of a Hamiltonian. A promising route in utilizing these devices is via met…
On the Descriptive Complexity of Vertex Deletion Problems
Max Bannach, Florian Chudigiewitsch, Till Tantau
Vertex deletion problems for graphs are studied intensely in classical and parameterized complexity theory. They ask whether we can delete at most k vertices from an input graph su…
Structure-Guided Automated Reasoning
Max Bannach, Markus Hecher
Algorithmic meta-theorems state that problems definable in a fixed logic can be solved efficiently on structures with certain properties. An example is Courcelle's Theorem, which s…
Existential Second-Order Logic Over Graphs: Parameterized Complexity
Max Bannach, Florian Chudigiewitsch, Till Tantau
By Fagin's Theorem, NP contains precisely those problems that can be described by formulas starting with an existential second-order quantifier, followed by only first-order quanti…