# Search Results

Results tagged with Search options user 55
9 results

Questions related to the (computational) complexity of solving problems

As pointed out by @Vor the point of polynomial-time reductions is to show that if have a reduction from A to B and an algorithm to solve a problem B then you can use it to efficiently (i.e. in polynom …
answered Oct 8 '12 by Artem Kaznatcheev
First of all, these are not subproblems but different types of problems. In one your promise me that $n/2$ of the clauses only have 2 literals, and in the other your promise me that only $\log n$ of t …
answered Mar 3 '14 by Artem Kaznatcheev
Suppose I have a graph $G$ with $M(G)$ the (unknown) set of perfect matchings of $G$. Suppose this set is non-empty, then how difficult is it to sample uniformly at random from $M(G)$? What if I am ok …
asked Mar 24 '13 by Artem Kaznatcheev
Although you already know from the other answers that the question is solvable in polynomial time, I thought I would expand on the computational complexity of reachability since you used complexity te …
answered Feb 6 '14 by Artem Kaznatcheev
As @Kaveh stated, this question is only interesting if we assume $P \neq NP$; the rest of my answer takes this as an assumption, and mostly provides links to further wet your appetite. Under that assu …
answered May 12 '12 by Artem Kaznatcheev
I think you misunderstood what it means to solve a diophantine equation, and Matiyasevich's indecidability theorem. Matiyasevich proved that for every RE set $S$ there is a diophentine equation $f(n; … answered May 17 '12 by Artem Kaznatcheev 1answer My goal is to solve the following problem, which I have described by its input and output: Input: A directed acyclic graph$G$with$m$nodes,$n$sources, and$1$sink ($m > n \geq 1\$). Output: T …