Category: Uncategorized

Problem Detail: Let $G = (V,E)$ be a directed graph with a weight function $w$ such that there are no negative-weight cycles, and let $v in V$ be a vertex such that there is a path from $v$ to every other Read More …

Problem Detail: In this paper (page 3 Theorem 1) the authors want to prove that their problem is NP-complete. Their method is as follows. Let their problem be known as $P$. They show that their problem can be written as a Read More …

Problem Detail: I am a little confused about the differences between Approximation Bayesian Computation (ABC) and Monte Carlo Methods (MCM). Citing from wikipedia: Approximate Bayesian computation (ABC) constitutes a class of computational methods rooted in Bayesian statistics. In all model-based statistical Read More …

Problem Detail: Suppose I have $M={1,ldots, n}$ men and $W = {1, ldots, n}$ women and $B ={1, ldots, m}$ brokers, such that each broker knows a subset of $M times W$ and for each pair in this subset a marriage Read More …

Problem Detail: Using the Deterministic Finite Automaton (Q, Σ, Δ, q_0, F): Alphabet: Σ is {(0 0), (0 1), (1 0), (1 1)} Definition of Δ to strings recursively: Δ*(q, ε) = q for all q ∈ Q Δ*(q, xa) = Read More …

Problem Detail: Say I have some problem of $Oleft(n^kright)$ complexity. If I were to solve the problem on a computer $x$, it would take time $t$. Now I have a new computer $x’$, which has double the computing power of $x$. Read More …

Problem Detail: I often see claims that modern functional strictly-typed languages are ‘safer’ than others. These statement mostly linked with type systems and their ability to explicitly express the following sources of pitfalls: Alternatives in function result. Maybe and Either datatypes Read More …

Problem Detail: Consider the following universe problem. The universe problem. Given a finite set $Sigma$ for a class of languages, and an automaton accepting the language $L$, decide if $L=Sigma^*$. In [1], it is stated and proved that the universe problem Read More …

Problem Detail:  If $B in NL$ and there exists a Karp reduction (polynomial-time many-one reduction) from $A$ to $B$, then $A in NL$. Prove that the above claim is correct, incorrect, or equivalent to an open question. Trying to solve Read More …