Problem Detail: Are $log_{10}(x)$ and $log_{2}(x)$ in the same big-O class of functions? In other words, can one say that $log_{10}(x)=O(log x)$ and $log_{2}(x)=O(log x)$? Asked By : David Faux Answered By : Dave Clarke Yes. Because they differ only by a constant Read More …
Author: ignougroup
[Solved]: Independent set where two vertices need to have distance >= c
Problem Detail: An independent set (IS) in a graph is a set $V’ subseteq V(G)$ of pairwise non-adjacent vertices. I am interested in the generalization $c$-IS where two nodes in $V’ subseteq V(G)$ need to have distance at least $c$ to Read More …
[Solved]: Implications of polynomial time reductions
Problem Detail: I’m reviewing for finals and have a sample problem that I think I understand, but would like someone to bless my understanding or smack me and tell me why I’m wrong. I’m presented with a problem $Pi$ of unknown Read More …
[Solved]: Is there a name/interest for regular languages that have a non-ambiguous ending?
Problem Detail: The basic idea is to have one or more symbol that clearly indicate the end. For example: Non-ambiguous: $ab^*c$ $(a|b)c$ $ab^+c$ $ab?c$ $a(b|c)$ $c(ab)^*ccc$ $acc^*d$ $abc|bcd$ Ambiguous: $abc^*$ $abc^+$ $abc?$ $acc^*$ or $ac^*c$ An alternative definition of a non-ambiguous Read More …
[Solved]: Can exactly one of NP and co-NP be equal to P?
Problem Detail: Maybe I am missing something obvious, but can it be that P = co-NP $subsetneq$ NP or vice versa? My feeling is that there must be some theorem that rules out this possibility. Asked By : aelguindy Answered By : Boris Read More …
[Solved]: Is there any nongeneral CFG parsing algorithm that recognises EPAL?
Problem Detail: EPAL, the language of even palindromes, is defined as the language generated by the following unambiguous context-free grammar: $S rightarrow a a$ $S rightarrow b b$ $S rightarrow a S a$ $S rightarrow b S b$ EPAL is the Read More …
[Solved]: Distinguishing between uppercase and lowercase letters in the “move-to-front” method
Problem Detail: Is it not necessary to encode both the uppercase and lowercase letter while encoding a message with the move-to-front transform? From an old computer science course exam, the problem was to encode Matt_ate_the_mat starting with an empty list. Using Read More …
[Solved]: Amdahl’s Law and Computer Science
Problem Detail: I would like to learn more about Amdahl’s Law and other similar topics. In what branch of computer science would one place Amdahl’s law? Could someone point me to a textbook or further reading (aside from Wikipedia or other Read More …
[Solved]: Finding squares touching points
Problem Detail: I am looking for an algorithm to solve the following problem: INPUT: a set of $n$ points in the plane, $(x_1,y_1),…,(x_n,y_n)$. OUTPUT: a set of $n-1$ axis-parallel interior-disjoint squares, such that the boundary of each square contains at least Read More …
[Solved]: Search in a partial ordering defined by tuples of numbers
Problem Detail: This is a graph theory and partial ordering problem. Consider a set of triples {(di,ai,ci)}i=1…N, which specify edges between two nodes A and B, d denotes a departure time, a an arrival time and c a cost. Technically there Read More …