6 problems

Let $m$ be the number of labels, and let Algorithm be the algorithm described in the paper for checking combinations of pairwise label preferences and finding…

Let $\kappa>0$ and let the symmetric binary perceptron (SBP) have constraint density $\alpha$. A search algorithm is stable when it satisfies the stability notion used in the paper.…

Safe-set algorithm conjecture. There exists a polynomial-time algorithm to find a minimum safe set in a clique acyclic digraph with a constant independence number $\alpha$.

Let $\mathcal{M}$ be a proper minor-closed class of binary matroids. Geelen–Gerards–Whittle's conjecture. There is a polynomial-time algorithm for computing the girth of matroids i…

Let $w$ be a binary word, and let ${\sc MemberPN}(w)$ be the proposed membership tester that applies the two linear-time rejection tests followed by a quadratic-time prefix-normali…

Let $n$ be the number of tetrahedra and let $k'$ denote the size of the standard solution set produced by Algorithm for converting a quadrilateral solution set to a standard soluti…