Related papers: Computing Heegaard genus is NP-hard

We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \begin{romannum} \item[{}] {\sc 3Sat, 1-3Sat, 1-Ex3Sat,…

This project investigates the potential of computers to solve complex tasks such as games. The paper proves that the complexity of a generalized version of spider solitaire is NP-Complete and uses much of structure of the proof that…

In the paper where he first defined Communication Complexity, Yao asks: \emph{Is computing $CC(f)$ (the 2-way communication complexity of a given function $f$) NP-complete?} The problem of deciding whether $CC(f) \le k$, when given the…

We consider the problem of partitioning a graph into a non-fixed number of non-overlapping subgraphs of maximum density. The density of a partition is the sum of the densities of the subgraphs, where the density of a subgraph is its average…

The problem of P vs. NP is very serious, and solutions to the problem can help save lives. This article is an attempt at solving the problem using a computer algorithm. It is presented in a fashion that will hopefully allow for easy…

3-SAT problem is of great importance to many technical and scientific applications. This paper presents a new hybrid evolutionary algorithm for solving this satisfiability problem. 3-SAT problem has the huge search space and hence it is…

We point out that the computation of true \emph{proof} and \emph{disproof} numbers for proof number search in arbitrary directed acyclic graphs is NP-hard, an important theoretical result for proof number search. The proof requires a…

The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…

The Goeritz group of a genus $g$ Heegaard splitting of a 3-manifold is the group of isotopy classes of orientation-preserving automorphisms of the manifold that preserve the Heegaard splitting. In the context of the standard genus 2…

Let K be a knot in a closed orientable irreducible 3-manifold M and let P be a Heegaard splitting of the knot complement of genus at least two. Suppose Q is a bridge surface for K. Then either \begin{itemize} \item $d(P)\leq 2-\chi(Q-K)$,…

We prove that deciding if a diagram of the unknot can be untangled using at most $k$ Riedemeister moves (where $k$ is part of the input) is NP-hard. We also prove that several natural questions regarding links in the $3$-sphere are NP-hard,…

A gap in a paper of Rubinstein-Scharlemann is explored: new examples are found of closed orientable 3-manifolds with possibly multiple genus 2 Heegaard splittings. Properties common to all the examples in the original paper are not…

Given a closed hyperbolic 3-manifold $M$, we construct a tower of covers with increasing Heegaard genus, and give an explicit lower bound on the Heegaard genus of such covers as a function of their degree. Using similar methods we prove…

Fix a finite group $G$. We analyze the computational complexity of the problem of counting homomorphisms $\pi_1(X) \to G$, where $X$ is a topological space treated as computational input. We are especially interested in requiring $G$ to be…

The constraint satisfaction problem (CSP) involves deciding, given a set of variables and a set of constraints on the variables, whether or not there is an assignment to the variables satisfying all of the constraints. One formulation of…

Let $S=\{K_{1,3},K_3,P_4\}$ be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph $G$ into graphs taken from any non-empty $S'\subseteq S$. The problem is known to be NP-complete for any…

An open book decomposition of a 3-manifold $M$ induces a Heegaard splitting for $M$, and the minimal genus among all Heegaard splittings induced by open book decompositions is called the \emph{open book genus} of $M$. It is conjectured by…

Majority-SAT is the problem of determining whether an input $n$-variable formula in conjunctive normal form (CNF) has at least $2^{n-1}$ satisfying assignments. Majority-SAT and related problems have been studied extensively in various AI…

Let $K_1, K_2$ be two knots with $t(K_1)+t(K_2)>2$ and $t(K_1 # K_2)=2$. Then, in the present paper, we will show that any genus three Heegaard splittings of $E(K_1 # K_2)$ is strongly irreducible and that $E(K_1 # K_2)$ has at most four…

The 0/1 knapsack problem is weakly NP-hard in that there exist pseudo-polynomial time algorithms based on dynamic programming that can solve it exactly. There are also the core branch and bound algorithms that can solve large randomly…