Problem Detail: Windows NT used a point-to-point protocol where a client can communicate “securely” with a server by using a stream cipher to encrypt an array of messages with some key $k$. The server also encrypts its response with the same Read More …
Category: Uncategorized
[Solved]: Recursive, Recursively Enumerable and None of the Above
Problem Detail: Let $A = mathrm{R}$ be the set of all languages that are recursive, $B = mathrm{RE} setminus mathrm{R}$ be the set of all languages that are recursively enumerable but not recursive and $C = overline{mathrm{RE}}$ be the set of Read More …
[Solved]: Context-free grammar for $L = {a^{2^k}, k inmathbb{N}}$
Problem Detail: In an exercise, I am asked to find a context free grammar for language $L = {a^{2^k}, k in mathbb{N}}$. I have been trying to use a “doubling” variable. If $a^{2n} in L, ninmathbb{N}$ then use this variable to Read More …
[Solved]: Can I simplify log(n+1) before showing that it is in O(log n)?
Problem Detail: Had a question about the following: $$log (n+1) in O(log n)$$ Can the left side be simplified any further or do I need to just go ahead and find a c and n that hold? Asked By : TacoB0t Answered Read More …
[Solved]: How to find longest recurring pattern from lage string data set?
Problem Detail: I need to find the substring that is from a 100,000 characters this substring must be most repeated and it need to be longest substring for example TYUFRIETEYM0SQZLHBCTN0W1KA9HELAT4LTQ14W7ZW484GSK1XTNOBJ2R6AMGW9KU36G7ITMPF315Y7ESYPR1XE2C1953J0DXUNBJLNTDG7IHS63854SGSS7YDEFJYSFP0DLL54GK6NUZ5UU5FRIETEYCPNGHIJOX23QOVSCBYHKE7HRIETEYV0H49I5SX9CW967CDGKX3TYCVNVBNCFGGDGDGDDFIIPGDSDVGDDSRGDGVCZAQRIOPKLMVFGCDGDTYGSDCBGDUSLVAQEFCGDGRIETEYDGDFG In above character set there is two substring one is GD Read More …
[Solved]: What is the difference between a R-tree and a BVH?
Problem Detail: I’ve just read about R-Trees: The key idea of the data structure is to group nearby objects and represent them with their minimum bounding rectangle in the next higher level of the tree; the “R” in R-tree is for Read More …
[Solved]: Can subtracting o(1) from the parameter of a function change its Θ-class?
Problem Detail: I would like to know if it is possible that two functions $f(n), g(n)$ can exist such that both of the following conditions are met: $g(n) = o(1)$ $f(n-g(n)) neq Theta (f(n))$ I though I found $1/n$ and $1/n^2$ Read More …
[Solved]: What do we know about NP ��� co-NP and its relation to NPI?
Problem Detail: A TA dropped by today to inquire some things about NP and co-NP. We arrived at a point where I was stumped, too: what does a Venn diagram of P, NPI, NP, and co-NP look like assuming P ≠ Read More …
[Solved]: Introduction into first order logic verification
Problem Detail: I am trying to teach myself different approaches to software verification. I have read some articles. As far as I learned, propositional logic with temporal generally uses model checking with SAT solvers (in ongoing – reactive systems), but what Read More …
[Solved]: Vapnik-Chervonenkis Dimension: why cannot four points on a line be shattered by rectangles?
Problem Detail: So I’m reading “Introduction to Machine Learning” 2nd edition, by Bishop, et. all. On page 27 they discuss the Vapnik-Chervonenkis Dimension which is, “The maximum number of points that can be shattered by H [the hypothesis class] is called Read More …
