Problem Detail: I try to understand balance factors change after local rotations in AVL trees. Given the rotate_left operation: x y’ / / a y => x’ c / / b c a b and $b(x)$, $b(y)$ – balance factors for Read More …
Category: Uncategorized
[Solved]: What would dynamically-typed languages actually do if type enforcement was removed?
Problem Detail: I program in Python, which is a well-known dynamically typed language. I understand dynamic typing to mean mainly that “operations” (in a loose sense) in the language are either allowed or denied (raise an exception) based on the type Read More …
[Solved]: CoNP and NPhard intersection
Problem Detail: Can a problem be both NP-Hard and CoNP? Can a problem be both NP and CoNP-Hard? Asked By : Turbo Answered By : Peter Shor There is a problem which is both NP-hard and in coNP if and only if NP Read More …
[Solved]: $log^*(n)$ runtime analysis
Problem Detail: So I know that $log^*$ means iterated logarithm, so $log^*(3)$ = $(loglogloglog…)$ until $n leq 1$. I’m trying to solve the following: is $log^*(2^{2^n})$ little $o$, little $omega$, or $Theta$ of ${log^*(n)}^2$ In terms of the interior functions, $log^*(2^{2^n})$ Read More …
[Solved]: Subgraph isomorphism in planar graphs
Problem Detail: I’m a computer engineer trying to understand this Eppstein paper for matching subgraphs in planar graphs. I’m trying to find subgraph matches to map an application graph (the subgraph) to a network-on-chip (the large graph). I have already implemented Read More …
[Solved]: this automata is NFA or DFA?
Problem Detail: That’s my question, since it has two symbols but go to a single state, is DFA or NFA? Asked By : Teo Answered By : Yuval Filmus First of all, every deterministic finite automaton is a fortiori a non-deterministic finite Read More …
[Solved]: Show that the Turing Machine domain can be viewed as a classical planning domain
Problem Detail: This is one of my assignments. I am not able to comprehend how to reduce the Turing machine domain to Classical planning domain. My understanding is that we have to essentially perform complexity analysis of classical planning domain. So Read More …
[Solved]: Why do Bloom filters work?
Problem Detail: Let’s say I am using Bloom filters to create a function to check if a word exists in a document or not. If I pick a hash function to fill out a bit bucket for all words in my Read More …
[Solved]: What’s the purpose of ANDing a bit mask with all bits set to a value?
Problem Detail: I’m adapting an algorithm for calculating a CRC 16-bit CCITT (XModem) value from an ASCII input. I’ve found some code here. I’m using the function the poster has in his question, but I’ve noticed at the bottom he does Read More …
[Solved]: What is Harrison hashing, its applications in web search engines?
Problem Detail: What is Harrison hashing and what are its applications in web searching? Can some one give me some relevant information? Update: I found it here , and is a part of M.Tech syllabus of a friend of mine. I Read More …
