4 papers
The Keplerian Traveling Salesperson Problem
Max Bannach, Giacomo Acciarini, Dario Izzo
We address a fundamental challenge in space mission design and space logistics: planning interplanetary trajectories for missions that must rendezvous with multiple bodies. Such mi…
#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
Max Bannach, Erik D. Demaine, Timothy Gomez +1
The canonical class in the realm of counting complexity is #P. It is well known that the problem of counting the models of a propositional formula in disjunctive normal form (#DNF)…
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…
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…