Author: ignougroup

Problem Detail: By reduction I mean the following: Problem X linear reduces to problem Y if X can be solved with: a) Linear number of standard computational steps. b) Constant calls to subroutine for Y. If a problem X reduces to Read More …

Problem Detail: The intuition is that on any input, we can write a symbol like $#$ on the left that tells the machine to not move past this symbol. However, I’m running into problems trying to show this using the formal Read More …

Problem Detail: First of all sorry, if this question already exists, in that case, pointing to the right direction will be appreciated. Secondly, sorry, if the question is below the expected level of Niveau, but all help appreciated. In the textbook Read More …

Problem Detail: I am going to teach a course in set theory for software engineering students. I am going to talk in this course about: ordinal numbers, partial orders, well ordering, generic filters and maybe some cardinal invariants (such as $mathfrak Read More …

Problem Detail: Where should I look for a good introductory text in algorithm complexity? So far, I have had an Algorithms class, and several language classes, but nothing with a theoretical backbone. I get the whole complexity, but sometimes it’s hard Read More …

Problem Detail: The usual statement of the fair cake-cutting problem assumes that all $n$ players get their share at the same time. However, in many cases the players arrive incrementally. For example, we may divide a cake over $n$ players, but Read More …

Problem Detail: When training a classifier for object detection using features extracted from images (eg HoG features), how important is it that the images used for training fed into the classifier in their natural aspect ratio? For example, regardless of their Read More …

Problem Detail: I am teaching myself algorithms with the online lecture notes by Jeff Erickson and fails to solve the following problem (Problem 21 of Lecture 1). (a) Describe an algorithm that sorts an input array $A[1 ldots n]$ by calling Read More …

Problem Detail: Assume ${f_i^{(n)}}_{i=0}^infty$ is a Gödel enumeration of the $mu$-recursive functions of $n$ arguments, such that the $S^m_n$ theorem and the universal function theorem hold. Denote the set of (total and partial) functions ${f:mathbb N^ktomathbb N }$ by $mathfrak F^k$ Read More …

Problem Detail: I’ve been reading Sedgewick’s intro to algorithms book, and he says that the reverse postorder of a digraph’s reverse is not the same as the postorder of the digraph, however in both cases it seems that we get the Read More …