The medial prefrontal cortex (mPFC) mediates a variety of complex cognitive functions via
its vast and diverse connections with cortical and subcortical structures. Understanding the …

We initiate the systematic study of a recently introduced polynomial-time analogue of MaxSNP,
which includes a large number of well-studied problems (including Nearest and Furthest …

… For the related Subset Sum problem this question has been resolved positively: Bringmann
and Nakos [BN21] conditionally ruled out strong approximation algorithms in time O((n + 1/ε)2…

… sparse variant of) the Maximum/Minimum Inner Product problem as complete under deterministic
fine-grained reductions: A strongly subquadratic algorithm for Maximum/Minimum Inner …

The Earth Mover's Distance is a popular similarity measure in several branches of computer
science. It measures the minimum total edge length of a perfect matching between two point …

The medial prefrontal cortex (mPFC) mediates a variety of complex cognitive functions via
its vast and diverse connections with cortical and subcortical structures. Understanding the …

… The only two exact problems that we consider in this problem are Min-Max Product and
Min-Max Convolution. Since both problems are of the Min-Max type, it is easy to see that we can …

We study the derivative nonlinear wave equation $- \partial _{tt} u + \Delta u = |\nabla u|^2$
on $\mathbb{R}^{1 +3}$ . The deterministic theory is determined by the Lorentz-critical …

Recently, brain-computer interfaces (BCIs) based on visual evoked potentials (VEPs) have
gained traction as a tool to improve quality of life in motor paralysis patients through …

… 2/3 max) and O(npmax w 2/3 max), improving upon an algorithm in time O(npmax wmax) by
… Bringmann and Cassis [BC22] gave an algorithm in time O(n + (pmax + wmax)1.5) which is …