Top new questions this week:
|
|
I wish there were more, but the subject pretty much captures my whole question.
Is there a non-Turing-complete model (some constrained term rewriting system or automaton or what have you) which is ...
|
|
Given a distance matrix for 50,000 points, how do I select $N$ points so that the sum of all distances between the $N$ points is maximized? $N$ could be as high as 100.
To calculate the sum of ...
|
|
Question:
Given integer $n \geq 2$ and two lists of size $n$, $A$ and $B$, of non-negative integers, determine if there exists an $n \times n$ matrix whose $i$-th row has $A[i]$ $1$s and whose $j$-th ...
|
|
Given a 3SAT problem with the additional constraints that:
No clause or set of clauses is the 3SAT instance is 'redundant'. Thus, this 3SAT cannot eliminate any clauses.
For any/every clause, the ...
|
|
I will be working on a project soon and as I'm clearly not a star (see what I did?) in CS, I'm not sure what to think about this.
To put it simply, the problem is the following:
We want to go from ...
|
|
When googling for the phrase "large horse walks into house" results that contain "close matches" for the phrase are also returned, e.g. "large horse in a house" and "...
|
|
What are some nice/natural examples of languages not contained in $P/\mathit{poly}$, preferably decidable ones?
I'm interested in unconditional results rather than examples such as the Karp–Lipton ...
|
Greatest hits from previous weeks:
|
|
Safe programming languages (PL) are gaining popularity. I wonder what is the formal definition of safe PL. For example, C is not safe, but Java is safe. I suspect that the property “safe” should be ...
|
|
I'm trying to solve the recurrence $$T(n)=2T(\sqrt{n})+\log n$$ using the master theorem. Which case applies here?
|
|
Question. Name the law given and verify it using a truth table. X+ X’.Y=X+Y
...
|
|
It's said that a program include algorithms, however if we refer to their definition, an algorithm is a sequence of instructions written to perform a specified task and
a computer program is also a ...
|
|
We learned about the class of context-free languages $\mathrm{CFL}$. It is characterised by both context-free grammars and pushdown automata so it is easy to show that a given language is context-free....
|
|
In a depth first tree, there are the edges define the tree (i.e the edges that were used in the traversal).
There are some leftover edges connecting some of the other nodes. What is the difference ...
|
|
I have come across many sorting algorithms during my high school studies. However, I never know which is the fastest (for a random array of integers). So my questions are:
Which is the fastest ...
|
Can you answer these questions?
|
|
It is clear to me that if some heuristic $h(x)$ is admissible, then $A^*$ is guaranteed to find a least-cost path. But is it also possible that $A^*$ is optimal if $h(x)$ is not admissible? In other ...
|
|
I am looking for a list of algorithms that depends on sorting / relative ranking / argsorting, not for a list of sorting algorithms.
I want to study and illustrate the importance of fast sorting in ...
|
|
I was reading distributed algorithms (by Nancy lynch) and there is a part that I would kindly like to get a simpler explanation for.
I know the book mentioned no algorithm can solve mutual exclusion ...
|
