# Search Results

Results tagged with Search options questions only user 55
4 results

Questions related to the (computational) complexity of solving problems

3answers
Given an instance of SAT, I would like to be able to estimate how difficult it will be to solve the instance. One way is to run existing solvers, but that kind of defeats the purpose of estimating di …
asked Mar 15 '12 by Artem Kaznatcheev
2answers
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
1answer
Modern SAT-solvers are very good at solving many real-world examples of SAT instances. However, we know how to generate hard ones: for instance use a reduction from factoring to SAT and give the RSA n …
asked Jul 22 '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 …
asked Apr 25 '12 by Artem Kaznatcheev