Related papers: A Note on the Hardness of the Critical Tuple Probl…
We introduce a robust belief-based measure of complexity. The idea is that task A is deemed more complex than task B if the probability of solving A correctly is smaller than the probability of solving B correctly regardless of the reward.…
We study the atomic embeddability testing problem, which is a common generalization of clustered planarity (c-planarity, for short) and thickenability testing, and present a polynomial-time algorithm for this problem, thereby giving the…
A lower bound on the minimum error probability for multihypothesis testing is established. The bound, which is expressed in terms of the cumulative distribution function of the tilted posterior hypothesis distribution given the observation…
This work explores the relationship between solution space and time complexity in the context of the $\textbf{P}$ vs. $\textbf{NP}$ problem, particularly through the lens of the sliding tile puzzle and root finding algorithms. We focus on…
We study the complexity of computational problems arising from existence theorems in extremal combinatorics. For some of these problems, a solution is guaranteed to exist based on an iterated application of the Pigeonhole Principle. This…
Numerous papers ask how difficult it is to cluster data. We suggest that the more relevant and interesting question is how difficult it is to cluster data sets {\em that can be clustered well}. More generally, despite the ubiquity and the…
The Sensitivity Conjecture is a long-standing problem in theoretical computer science that seeks to fit the sensitivity of a Boolean function into a unified framework formed by the other complexity measures of Boolean functions, such as…
Using the Mountain--Pass Theorem of Ambrosetti and Rabinowitz we prove that $-\Delta_p u-\mu|x|^{-p}{u^{p-1}}=|x|^{-s}{u^{\crits-1}}+u^{\crit-1}$ admits a positive weak solution in $\rn$ of class $\dunp\cap C^1(\rn\setminus\{0\})$, whenever…
We study the complexity of a classic problem in computational topology, the homology problem: given a description of some space $X$ and an integer $k$, decide if $X$ contains a $k$-dimensional hole. The setting and statement of the homology…
Tuza conjectured that for every graph $G$, the maximum size $\nu$ of a set of edge-disjoint triangles and minimum size $\tau$ of a set of edges meeting all triangles satisfy $\tau \leq 2\nu$. We consider an edge-weighted version of this…
Let $G$ be a complete edge-weighted graph on $n$ vertices. To each subset of vertices of $G$ assign the cost of the minimum spanning tree of the subset as its weight. Suppose that $n$ is a multiple of some fixed positive integer $k$. The…
We introduce bipol, a new metric with explainability, for estimating social bias in text data. Harmful bias is prevalent in many online sources of data that are used for training machine learning (ML) models. In a step to address this…
A recent work of the authors on the analysis of pairwise comparison matrices that can be made consistent by the modification of a few elements is continued and extended. Inconsistency indices are defined for indicating the overall quality…
Sensitivity conjecture is a longstanding and fundamental open problem in the area of complexity measures of Boolean functions and decision tree complexity. The conjecture postulates that the maximum sensitivity of a Boolean function is…
We formally study two methods for data sanitation that have been used extensively in the database community: k-anonymity and l-diversity. We settle several open problems concerning the difficulty of applying these methods optimally, proving…
A new framework is found for the compactification of supersymmetric string theory. It is shown that the massless spectra of Calabi--Yau manifolds of complex dimension $D_{crit}$ can be derived from noncritical manifolds of complex dimension…
We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…
This paper presents a new representation of natural numbers and discusses its consequences for computability and computational complexity. The paper argues that the introduction of the first Peano axiom in the traditional definition of…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
The classical stable marriage problem asks for a matching between a set of men and a set of women with no blocking pairs, which are pairs formed by a man and a woman who would both prefer switching from their current status to be paired up…