Problem Detail: What I want to do is turn a math problem I have into a boolean satisfiability problem (SAT) and then solve it using a SAT Solver. I wonder if someone knows a manual, guide or anything that will help Read More …
Author: ignougroup
[Solved]: Methods for Finding Asymptotic Lower Bounds
Problem Detail: I’ve found in many exercises where I’m asked to show that $f(n)=Theta(g(n))$ where the two functions are of the same order of magnitude I have difficulty finding a constant $c$ and a value $n_0$ for the lower bound. I’m Read More …
[Solved]: Is order of bits in byte really not of concern?
Problem Detail: What I can’t wrap my head around is sentence repeated everywhere I look, that order of bits in byte is not important(not of my, as a programmer, concern). My question then is if there is possibility that it makes Read More …
[Solved]: Do we need recursion in programming language to solve any problem?
Problem Detail: My question is simple: If we want to be able to solve every problem, that we can solve using recursions, do we need programming language to allow us use recursions? Assuming we are allowed to use: conditional evaluation of Read More …
[Solved]: AMAT question cache here
Problem Detail: Suppose that the processor reads cache memory in one clock cycle.In case of cache miss the processor needs 5 clock cycles to read the information in the main memory.What should be the value of Cache hit rate so that Read More …
[Solved]: If I solve hard instance, therefore I prove NP=P?
Problem Detail: If someone (off-topic) asks a question (on-topic) like this: Suppose that he claims that $mathcal{P=NP}$. Suppose that someone else (on-topic) gives him an instance of an NP-complete problem that cannot be solved by any computer optimally, i.e., to get Read More …
[Solved]: Example of graph with exponential many s-t minpaths and min cuts
Problem Detail: I am trying to find a graph in which both s-t minpaths and min cuts are exponential. Individually I found examples in which s-t minpaths and s-t min cuts are exponential. Can some one provide me an example of Read More …
[Solved]: Is any language that can express its own compiler Turing-complete?
Problem Detail: A comment over on tex.SE made me wonder. The statement is essentially: If I can write a compiler for language X in language X, then X is Turing-complete. In computability and formal languages terms, this is: If $M$ decides Read More …
[Solved]: Minor Mistake in Computability, Complexity, and Languages?
Problem Detail: In the book Computability, Complexity, and Languages (2nd edition), Martin Davis writes in chapter 1 (Preliminaries), section 2 (Functions): A partial function on a set $S$ is simply a function whose domain is a subset of $S$. An example Read More …
[Solved]: Algorithm to check whether a complete, undirected graph is fullfilling the triangle inequality
Problem Detail: I am searching for an algorithm to check whether a complete, undirected graph is fullfilling the triangle inequality( $text{weight}(u,v) le text{weight}(u,w) + text{weight}(w,v)$ for all vertices $u, v, w$). My first naive try was to use an algorithm for Read More …
