Problem Detail: I’m looking for an (efficient) algorithm to solve the following problem: Given a string $S$ and a set of characters $M$, find the shortest string composed only of characters in $M$ that is not contained in $S$. Try as Read More …
Category: Uncategorized
[Solved]: How to show composition of one way function is not such?
Problem Detail: I was wondering how should I proceed in order to show that the composition of (say) two one-way functions (either weak or strong or both together) is not a one-way function? Specifically: Say $f$ and $g$ are one-way functions Read More …
[Solved]: complexity of decision problems vs computing functions
Problem Detail: This is an area that admittedly I’ve always found subtle about CS and occasionally trips me up, and clearly others. recently on tcs.se a user asked an apparently innocuous question about N-Queens being NP hard, But it got downvoted Read More …
[Solved]: Importance of recursion in computability theory
Problem Detail: It is said that computability theory is also called recursion theory. Why is it called like that? Why recursion has this much importance? Asked By : user5507 Answered By : Andrej Bauer In the 1920’s and 1930’s people were trying to Read More …
[Solved]: Why are weights of Neural Networks initialized with random numbers?
Problem Detail: Why are neural networks initial weights initialized as random numbers? I had read somewhere that this is done to “break the symmetry” and this makes the neural network learn faster. How does breaking the symmetry make it learn faster? Read More …
[Solved]: Is there a computationally reasonable algorithm for generating a set of polygons from a set of 2d points?
Problem Detail: Is there a known/existing algorithm for taking a 2D canvas covered in arbitrarily/randomly distributed points and dividing it entirely into a set of non-overlapping polygons? An example of the kind of result I’m looking for: Asked By : CaptainRad Answered Read More …
[Solved]: Concorde time efficiency
Problem Detail: What is the efficiency of Concorde TSP solver program. And is it have any weaknesses? I build my own exact solver and I want to compare it to Concorde. What would be the best way to do this? Asked Read More …
[Solved]: Detecting palindromes in binary numbers using a finite state machine
Problem Detail: In my first algorithms class we’re creating these patterns that are supposed to model a finite state machine. We were given a task to think if we can figure out a way to detect palindromes in binary sequences (no Read More …
[Solved]: Polygons generated by a set of segments
Problem Detail: Given a set of segments, I would like to compute the set of closed polygons inside the convex hull of the set of the end of those segments. The vertices of the polygons are the intersections of the segments. Read More …
[Solved]: Characterisation of graphs that are not 3-colorable
Problem Detail: We know that all graphs with odd cycles (odd number of vertices) are not 2-colorable. Is there a similar characterisation for 3-colorability? I am looking for undirected graphs that are not 3-colorable depending on a single graph property e.g. Read More …
