instruction stringlengths 35 11.4k |
|---|
Is it possible to design a compiler which optimizes a loop in which arrays are accessed in alternate fashion? For example like this:
// int[] a,b
int sum = 0;
for(int i = 0; i < n; i++)
{
sum += a[i] + b[i];
}
With the usual sequential array storage, a[i] and b[i] may be far away from each other in memory. Therefore... |
I have been reading some papers where I keep reading stuff like “first-order formula modulo a background theory”. Does anyone know what modulo means in this case ? Is it something like “with respect to”?
|
For an assignment I have to program an application to schedule conversations.
There is an event where representatives of the elementary schools talks with the representatives of high schools. They will talk about the students that will be transferred to the highschool. There are approximately 200 elementary schools an... |
We collect most of the information about possible compiler optimizations during forward pass. Is it possible to utilize the information collected in forward pass in a backward pass so as to perform better optimizations ?
Note: I have been going through the patent Compiler with cache utilization optimizations by Roch G.... |
How exactly Loop Dependence Analysis helps in vectorization ? Are there any standard rules of safety criterias for parallizing such loops ?
|
As the new semester starts soon, I am interested in research regarding the teaching of introductory programming courses. I would like to improve my university course and I am looking for scientific papers on that topic.
One trend I have seen is that some students (a smaller group) are interested in computers or they ha... |
I'm looking for a major in Theoretical Computer Science; specifically, I'm interested on complexity theory and probabilistic automata theory. As I'm graduating in one year, what advanced courses in math (like Galois theory or Harmonic analysis, for example) do you think would be useful to take over the next two semeste... |
Lets say I have given following grammar which generates arithmetic expressions in reverse polish notation:
$G=({E},{a,+,*},P,E)$
$P={ E \rightarrow EE+ | EE* | a }$
I know this grammar is unambiguous.
What I do not understand is how I can prove this.
I already searched a lot to in google, etc. but everyone only says... |
I try to teach myself the usage of bison. The manpage bison(1) says about bison:
Generate a deterministic LR or generalized LR (GLR) parser employing LALR(1), IELR(1), or canonical LR(1) parser tables.
What is an IELR-parser? All relevant articles I found on the world wide web are paywalled.
|
I'm reading through "Computers and Intractability: A guide to the Theory of NP-Completeness" by Michael R. Garey and David S. Johnson, p. 20 and I came across this concept of a function that is polynomially related to input lengths obtained using some encoding scheme. Let $$Len:D_{\Pi}\rightarrow \mathbb Z^+$$ be a fun... |
The problem is:
$$\exists x \forall y (x \ge y)$$
With a domain of all real positive integers.
The negation is:
$$\forall x \exists y (x < y)$$
so, if $y = x + 1$, the negation is true.
That means the negation of the negation (i.e. the original problem) is false.
My question is, that if the original problem is $\exists... |
I keep coming across references to fixed point in questions and answers at stackexchange and I look up the meaning on the web obviously finding reference at sites such as Wikipedia. However none of the references really answer my question of what is a fixed point and what does it mean in the world of computer science.
... |
What is does it mean when an argument to a function is called a dummy argument? I have not encountered this term outside Fortran, is it a general term in computer science? What would be examples of arguments passed as dummy and not passed as dummy?
I found this definition, which I am not sure that I understand, but it ... |
In Big Theta notation used for defining the running time of an algorithm, are the constants $c_1$ and $c_2$ different for every value of $n$?
Definition:
$\qquad \displaystyle \Theta (g(n)) = \{ f(n): \exists\, c_1,c_2,n_0>0. \forall n \geq n_0.\ \ c_1g(n) \leq f(n) \leq c_2g(n) \}.$
|
Possible Duplicate:
Negation of nested quantifiers
The problem is:
∃x∀y(x ≥ y)
With a domain of all real positive integers.
The negation is:
∀x∃y(x < y)
so, if y = x + 1
the negation is true.
That means the negation of the negation (or, the original problem) is false.
My question is, that if the original problem is ... |
I wonder whether there is a simple algorithm to do this work:
Say I have a collection of objects $C$, and a binary relation $R: C\times C$ that is auto-reflective ($\forall c\in C: c R c$) , and symmetric ($\forall b,c\in C: b R c \implies c R b$). The relation is not necessarily transitive.
I want to find an inte... |
Currently, I am self-studying Intro to Algorithms (CLRS) and there is one particular method they outline in the book to solve recurrence relations.
The following method can be illustrated with this example. Suppose we have the recurrence
$$T(n) = 2T(\sqrt n) + \log n$$
Initially they make the substitution m = lg(n), a... |
I have a function to count upper bits of a 32 bit value. So if a number is 11100011111..., the result is 3 as there are 3 ones in the most significant place before a 0 is hit.
I need to convert the function to use only bitwise operations (no if statements or while loops) and the total number of operations should be les... |
I've done some searching and it seems that fuzzy logic is used in (electronic) controllers. I'm interested in seeing how well it fares as a tool for reasoning. Are there any robots or programs that do clever things with it?
|
Given a directed graph $G=(V,E)$ and a node $r\in V$, I need to grow a tree $T$ rooted at $r$ that has a minimum weight and spans all reachable nodes in $G$.
The weight function assigns a non-negative weight to each node, which depends on the node's ancestors in $T$. Specifically, for some fixed sets of nodes $S_1, S_... |
I have an question relating to the elementary foundations of Turing Machine theory. I would like to have a clarification of the status of a function $\phi$ (a mapping between TM indexes) I shall introduce in the formal question after the preamble. First to the preamble.
Let us assume that we have a fixed Turing Machine... |
I am unable to understand why there is a requirement of 3m+1 generals overall given m traitors. As per my understanding, the steps are as follows:
Each general decides a strategy and forwards their strategy to all the other ($3m$) generals.
Each general forwards a vector containing the strategies (of all the other gen... |
A nondeterministic machine trying to decide membership in a language
is presented with a hint (called a "witness" or "certificate") which
proves membership (no such witness is provided for elements outside
the language; the definition is asymmetric).
So, if a non-deterministic algorithm can solve a problem in O... |
Is it possible an algorithm complexity decreases by input size? Simply $O(1/n)$ possible?
|
I've studied something about the Kolmogorov Complexity, read some articles and books from Vitanyi and Li and used the concept of Normalized Compression Distance to verify the stilometry of authors (identify how each author writes some text and group documents by their similarity).
In that case, data compressors were us... |
My question is related to the Integer Relation Detection Problem which can be formulated as:
$\qquad a_1x_1 + a_2x_2 + \cdots + a_nx_n = 0$
Where $\forall i. a_i\in\mathbb{Z} \land a_i<c \land x\in \mathbb{R}$, and $\exists i. a_i\neq 0$. $c$ and vector $\mathbf{x}$ are given, and the problem is to find a valid vector ... |
Introduction to Algorithms, 3rd edition (p.95) has an example of how to solve the recurrence
$$\displaystyle T(n)= 3T\left(\frac{n}{4}\right) + n\cdot \log(n)$$
by applying the Master Theorem.
I am very confused by how it is done. So, $a=3, b=4, f(n) = n\cdot \log(n)$
First step is to compare $n^{\log_b a} = n^{\log_4 ... |
I am trying to understand this problem from Algorithms. by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, chapter8, Pg281. Problem 8.19
A kite is a graph on an even number of vertices, say $2n$, in which $n$ of the vertices form a clique
and the remaining $n$ vertices are connected in a “tail” that consists of a p... |
I am a PhD student in Computer Science who switched his PhD a little bit towards ML algorithms combined with something else... I am an expert in that something else, say image processing, but not an expert in Machine Learning. What should I read/learn to get the ML mathematics right? Especially for adaptive learning al... |
Say I have an LR grammar G and a string w. I know that I can check if w is in the language of G in linear time. But what if w itself is not in the language of G, but I want to find all substrings of w that are in the language of G? And can I get parse trees for those substrings? What would be the time complexity for th... |
How can I prove that the conversion from CNF to DNF is NP-Hard?
I'm not asking for an answer, just some suggestions about how to go about proving it.
|
I have seen two definitions of balanced binary trees, which look different to me.
A binary tree is balanced if for each node it holds that the number of inner nodes in the left subtree and the number of inner nodes in the right subtree differ by at most 1.
A binary tree is balanced if for any two leaves the difference... |
General satisfiability (with a few exceptions such as Horn Clauses) is not believed to have an algorithmic solution. However, the following algorithm appears to be a solution for general satisfiability. What exactly is the flaw with the following algorithm?
Let $W$ be an empty set which will contain all variable... |
I want to write an algorithm to find whether a directed circuit whose length is odd exists in a strongly connected digraph.
Can anyone help me how to proceed with this problem???
|
I have been reading about PHP and many authors mention semantic and logical errors separately. As an example of a semantic error, they give a function called with incorrect number of parameters: this will not be caught by the parser, but will throw an error when run.
Yet in languages such as C++, this will be caught by... |
In algorithms and complexity we focus on the asymptotic complexity of algorithms, i.e. the amount of resources an algorithm uses as the size of the input goes to infinity.
In practice, what is needed is an algorithm that would work fast on a finite (although possibly very large) number of instances.
An algorithm which... |
I have a question and I haven't been able to figure out the answer yet. I need to do the on-line simulation of a two-head tape Turing machine using single-head tape(s). I've found some online articles for the fact that one single-head tape doesn't suffice for this problem and the simulation should be done using two sin... |
It's easy to see how a multi-track Turing machine can simulate a single-track Turing machine; it does so by ignoring all but the first track. But how does it work the other way? I need a specification of a transition function that does the job. If there are $k$ tracks, then we can think of symbols as being vectors and ... |
I have created the algorithm below...
String A = v[0];
int val = 1;
for (int i = 1; i < v.length; i++) {
if (val == 0) {
A = v[i];
val++;
} else if (v[i].equals(A))
val++;
else
val--;
}
... |
Is a Turing Machine that is allowed to read and write symbols from an infinite alphabet more powerful than a regular TM (that is the only difference, the machine still has a finite number of states)?
Intuition tells me not, since you need an infinite number of states to differentiate each symbol. So I think some of the... |
I was reading about Turing machines and realized I'm not sure about the difference between the following scenario. Given the alphabet $\Sigma = \{a, b \}$, we have the following assertions:
$a \in R $
$\{a\} \in R$
I think that assertion $1$ is incorrect because $a$ is just a symbol, not a language. On the other hand... |
I am an undergraduate student in Industrial Engineering. I have taken the topic of Travelling Salesman Problem as a Research Project for my final year. More specifically, I am focusing on Convex Hulls for solving the Euclidean TSP.
I have gone through the published literature and have found that there are no approximat... |
I'm currently in a class on Computability and we just finished looking at formal grammars before moving onto finite automata. We were given an several examples of a formal grammar, and one stuck out in particular:
V: { S, A, B, C }
T: { a, b, c }
P: {
S -> aA | λ | ASA
AA -> aA | a
}
My professor described the ... |
I am a 16 year old male who has recently been gifted a big encyclopedia on computer science by a friend of mine. I am usually not that interested in computers and technology, but computer science has started to fascinate me. I do however intend to study Physics and/or Mathematics and not CS, so my question is, would it... |
I am converting the OCaml Format module which does I/O and maintains state in a record with mutable values. As such it is a good candidate for me to convert to pure F#, pure C# and a hybrid.
Since this is a toss-up for me on the three versions, I am interested to know of any research papers that indicate that programme... |
Does accepting mean that the TM will read and recognize a char from the cell it's currently reading from? And is it the case that a TM halts iff the input is decidable?
|
If they are different, what are the typical problems in each that do not fall on the other category? Or are the mutually exclusive or does one completely capture the other?
|
I saw a RAM model diagram that displayed an input tape, output tape, the program (read-only), the instruction pointer, and the memory registers. However, when I look at questions of time complexity, it is relevant how much time the program needs to spend on one action. Say you want to read one integer symbol from the r... |
is the following true
$ (L^R)^* = (L^*)^R $
I tried the following to prove it true.
let u,v belong to L then $ L^* = \{ u,v, uu, vv, uv, vu ... \} $
and $ (L^*)^R = \{ u^R, v^R, u^Ru^R, v^Rv^R, v^Ru^R, u^Rv^R ... \} $
now $ L^R = \{ u^R, v^R \} $ so
$(L^R)^* = \{ u^R, v^R, u^Ru^R, v^Rv^R, u^Rv^R, v^Ru^R ... \} $
|
I have a problem that is almost equal to the standard one of the dining philosophers, but has a quirk: while a philosopher thinks, he still holds the fork on his left.
If after the period of thinking (which isn't infinite), I release the fork on the left and then apply the normal solution (that is, acquire forks in the... |
I understand that $\Theta(n)$ is faster than $\Theta(n\log n)$ and slower than $\Theta(n/\log n)$. What is difficult for me to understand is how to actually compare $\Theta(n \log n)$ and $\Theta(n/\log n)$ with $\Theta(n^f)$ where $0 < f < 1$.
For example, how do we decide $\Theta(n/\log n)$ vs. $\Theta(n^{2/3})$ or $... |
How can we assert that the performance of an implementation matches the expected performance defined in terms of Big-$\mathcal{O}$ and friends by generating best/worst case inputs? I'm thinking of a table whose columns are input length, expected running time, actual running time. Are there general methods for generatin... |
If $K(s)$ is the Kolmogorov complexity of the string $s \in \{0,1\}^*$,
Can we prove (or disprove) the following statement:
"Every string $s$ is a prefix of an incompressible string; i.e. for every string $s$ there exists a string $r$ such that $K(sr) \geq |sr|$" ?
In a very informal (and perhaps not too meaningful)... |
Let Alice and Bob be two users chosen uniformly at random from a social network (e.g. Facebook). What is the probability that they are friends assuming that they share $k$ mutual friends?
I am interested both in the experimental values (or estimates) from currently existing social networks (e.g. Facebook) and values pr... |
I am just beginning to learn computation theory. I wrote up a non-deterministic finite automata that accepts strings that contain the substring "abba":
I tried to convert it to a DFA by putting together sets of states in the NFA to be states of the DFA:
However, I just realized that my DFA doesn't accept strings such ... |
I'd like to understand what approaches should one adopt when deciding/proving that a given function F is uncomputable, by any Turing Machine (TM). The ones I've tried so far are as follows:
Reduction, from a known uncomputable function (such as $UC(\alpha)$, the uncomputable function as proved by Cantor's diagonalizat... |
I am reading section 6.4 on Heapsort algorithm in CLRS, page 160.
HEAPSORT(A)
1 BUILD-MAX-HEAP(A)
2 for i to A.length downto 2
3 exchange A[i] with A[i]
4 A.heap-size = A.heap-size-1
5 MAX-HEAPIFY(A,1)
Why is the running time, according to the book is $\Theta (n\lg{n})$ rather than $\Theta (n^2\lg{n})$ ?... |
I'm confused to conclude the recursion tree method a guess for the next recurrence:
$$T(n)=3T\left (\left\lfloor \frac{n}{2}\right \rfloor\right) +n$$
I write some costs for the levels of tree, you can see, but I'm confusing in the final guess. I know for the master theorem that the answer for the guess is like that
$... |
I write this code in python:
def sub(ma):
n = len(ma); m = len(ma[0])
if n != m : return
n2 = int(ceil(n/2))
a = []; b = []; c = []; d = []
for i in range(n2):
a.append(ma[i][0:n2])
b.append(ma[i][n2:n])
c.append(ma[n2+i][0:n2])
d.append(ma[n2+i][n2:n])
return [a... |
I was given a homework assignment with Big O. I'm stuck with nested for loops that are dependent on the previous loop. Here is a changed up version of my homework question, since I really do want to understand it:
sum = 0;
for (i = 0; i < n; i++
for (j = 0; j < i; j++)
sum++;
The part that's throwing me ... |
Stephen Cook's proof of the NP-completeness of SAT is constructive. Given a Turing machine $M$, one can create a logical formula that is satisfiable if and only if $M$'s computation halts in an accepting state. This suggests that we could take a logical formula and create a Turing machine $M'$ whose computation is desc... |
So we have the following table of processes , where A, B and $\Gamma$ are the resources.
Here is a pic that i drew with the processes and the resources.
So the exact question is this: Using banker's algorithm, calculate the minimum values of $x$ and $y$ in order the system is Deadlock free.
I have done pretty much hug... |
The source of this question comes from an undergraduate course I am taking, which covers an introduction to the analysis of algorithms. This is not for homework, but rather a question asked in CLRS.
You have a slow machine running at $x$ MIPS, and a fast machine running at $y$ MIPS. You also have two algorithms of the ... |
Straight to the point: I would really like to learn AI.
But I want some advice from experienced CS guys as to when I should jump into Artificial Intelligence.
What prerequisites are needed in order for me to better grasp the AI concepts?
|
Are there any grammar classes which are true subsets of Chomsky level 2 but not equal to level 1?
|
The $k$-anonymization paradigm (and its refinements) means to create datasets where every tuple is identical with $k-1$ others.
However I'm in a situation where people are in the dataset many times. And I want to follow their progress through the health care system, so I need to know who is who. If I give each person a... |
Substation method fails to prove that $T(n)=\Theta(n^2) $ for the recursion $T(n)=4T(n/2) + n^2$, since you end up with $T(n) < cn^2 \leq cn^2 + n^2$.
I don't understand how to subtract off lower-order term to prove that substitution works.
Came up with: $T(n) \leq cn^2 - bn^2$
Assume it holds for $T(n/2) \leq c(n/2)... |
I was watching the video lecture from MIT on Prim's algorithm for minimum spanning trees.
Why do we need to do the swap step for proving the theorem that if we choose a set of vertices in minimum spanning tree of $G(V,E)$and let us call that $A$ such $A\subset B$, the edge with the least weight connecting $A$ to $V-... |
I need to create a bloom filter of 208 million URLs. What would be a good choice of bit vector size and number of hash functions? I tried a bit vector of size 1 GB and 4 hash functions, but it resulted in too many false positives while reading.
I have a huge web corpus containing web content of billions of URLs. I need... |
At my local squash club, there is a ladder which works as follows.
At the beginning of the season we construct a table with the name of each
member of the club on a separate line.
We then write the number
of games won and the number of games played next to each name (in the form: player wins/games).
Thus at the begin... |
I've been doing some reading (I'll name drop along the way) and have selected a few scattered ideas that I think could be cobbled together into a nifty esoteric programming language. But I'm having some difficulty assembling the parts.
Kleene's Theorem states: Any Regular Set can be recognized by some Finite-State Mach... |
Assuming P $\neq$ NP, NP-complete problems are "hard to solve, but have answers that are easy to check." Does it make any sense to consider the opposite, that is, problems for which it's easy to compute a correct answer, but hard to verify an arbitrary purported solution?
I think such a problem would imply either:
E... |
Is it possible to reduce MaxUNSAT to MaxSAT in a polynomial way ?
When considering the MaxSAT problem, one often considers also the MinUNSAT problem, which is almost the same. And for a propositional formula f in CNF it holds:
|f| = MaxSAT(f) + MinUNSAT(f)
where |f| is the number of clauses of f.
When considering MaxU... |
I want to define a semantics of a DSL through transition semantics. For my DSL I defined the syntax and implemented a code generator. Although I can provide a demo by giving examples, I want to write the semantics of my DSL to provide a formal specification of it.
However I don't know how to do it!. Can someone provid... |
Is there an algorithm for finding the shortest path in an undirected weighted graph?
|
I'm being asked to create a "top down grammar" for a certain language (I'm pretty sure there's no such thing as a "top down grammar" but I think it means write a grammar that an LL(k) parser can parse).
I'm pretty sure the language is not LL(1), but I can remove left-recursion and common prefixes from it and still have... |
We have a set X of N elements. We want to get a new set X' having a size M < N.
Choose a first element x from X and put it in X'
for each element x in (X - X')
Let x' the element from X' which is the closest to x (that is x' = argmin distance(x, x') for all x' in X')
d = distance(x, x')
if ( uniform_random([0,1])... |
Consider a graph $G(V,E)$. Each edge $e$ has two weights $A_e$ and $B_e$. Find a spanning tree that minimizes the product $\left(\sum_{e \in T}{A_e}\right)\left(\sum_{e \in T}{B_e}\right)$. The algorithm should run in polynomial time with respect to $|V|, |E|$.
I find it difficult to adapt any of the traditional algori... |
I have a sequence of $n$ integers in a small range $[0, k)$ and all the integers have the same frequency $f$ (so the size of the sequence is $n = f * k$). What I'm trying to do now is to compress this sequence while providing random access (what is the $i$-th integer). I'm more interested in achieving high compression ... |
I am performing an addition operation on two large binary numbers that have an equal number of bits. Both numbers are stored in an array of length $N$, which is rather large.
At first I tried running a loop over them and keeping track of carry bits. This wasted time, because the aim is to get the bit at a specific posi... |
I read on Wikipedia that unification is a process of solving the satisfability problem.
At the same time, I know that such solvers are called "SAT solvers" or "SMT solvers". So, are they different names for the same thing?
If you say that they are different, please point out a flaw in my treatment.
|
When proving theorems with the superposition calculus, we deal with three kinds of rules:
Generating rules: from pair of clauses A and B, generate new clause C while keeping the original pair, e.g. superposition in the general case.
Rewriting rules: from clause A generate new clause B, e.g. equality reflexivity, equal... |
I'm reviewing for my midterm and wanted to post this to see if anyone can spot any errors. Im supposed to make a PDA that recognizes this CFG:
$\qquad\begin{align}
S &\to R1R1R1 \\
R &\to 0R \mid 1R \mid \varepsilon
\end{align}$
Here is my solution; I'm aware that I forgot to draw the second circle around my accept... |
I'm going through the MIT Online Course Videos on Intro. to Algorithms at here at around 38:00.
So we have a recursion formula
$\qquad T(n) = T(n/10) + T(9n/10) + O(n)$
If we build a recursion tree it looks like
T(n) -- Level 1 = c*n
/ \
T(... |
I have a number of related questions about these two topics.
First, most complexity texts only gloss over the class $\mathbb{NC}$. Is there a good resource that covers the research more in depth? For example, something that discusses all of my questions below. Also, I'm assuming that $\mathbb{NC}$ still sees a fair ... |
Context
I've been programming in java for a few years now. And atm i'm learning something totally different: Clojure.
There the expression problem can be solved by using multimethods whereas in java you will need something like the visitor pattern or something alike.
The question
I've been reading about multimethods an... |
I teach computing to 18 year olds. After having reverse polish notation (RPN) explained to them, one asked why is it significant enough to be in the public exam. I explained the historical significance of '70s calculators, but this failed to really address the issue.
So, are there any modern practical or theoretical ap... |
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 there & goes unanswered because the audience felt it was poorly phrased.
The issue seem... |
I am designing a small DSL and I know that implementing dynamic scoping (with a simple global stack) is easier then using full lexical scoping (each function needs its own scope/closure). What kind of features can be added that do not care how scope is implemented and what features would require a particular kind of sc... |
If there is someone can prove that the problem "is P equals to NP?" is a NP-COMPLETE problem, what we can conclude from this?
|
Consider a Büchi automaton $\mathcal{A}$ with the modified acceptance condition, that an $\omega$-word $\mathcal{w}$ is accepted by $\mathcal{A}$ iff every run $\rho$ of $\mathcal{A}$ on $\mathcal{w}$ is accepting (rather than at least one run being accepting). I need to show that this automaton also accepts only $\ome... |
I am doing a project on face detection in C#. I want to find the skin area by using skin color segmentation. For that purpose, I have to extract the skin area.
I know I can use HSI or YCbCr, but what is the exact difference between these?
|
Am I correct in my observation that the cardinality of the maximum matching $M$ of a bipartite graph $G(U, V, E)$ is always equal to $\min(|U|, |V|)$?
|
I just had this interesting question. What is the fastest growing function known to man? Is it busy beaver?
We know functions such as $x^2$, but this function grows slower than $2^x$, which in turn grows slower than $x!$, which in turn grows slower than $x^x$. We can then combine functions, to have $(x^x)!$ that grows ... |
I have this little exercise:
for ( i = 0; i < 2 * n; i += 2 )
for ( j = 1; j <= n; j <<= 1 )
if ( j & i )
foo ();
(j <<= 1 means j = (j << 1), where << is the bitwise left shift operator. & is the bitwise and operator.)
I am supposed to determine how many times will the foo function be called for some n. T... |
I have this simple 'assignment' problem:
We have a set of agents $A = \{a_1, a_2, \dotso, a_n\}$ and set of tasks $T= \{t_1, t_2, \dotso, t_m\}$. Note that $m$ is not necessarily equal to $n$. Unlike the general assignment formulation in Wikipedia, a task $t_c$ can only be assigned to an agent based on the task's prefe... |
In helping someone understand phrase generators for use with testing grammars, think compiler test cases, I noted that I have never found a phrase generator that is knowledgeable of the grammar, and is deterministic. The phrase generators I am talking about rely on the grammar of the language as input so that the user ... |
I recently read an article Scott Aaronson - Big Numbers . That has made me think about the effective upper-bound for sorting.
According to the article, some of the big numbers like the number of particles in the universe and age of universe in milliseconds are less than $10^{100}$.
In any realistic computational device... |
If a graph has a Euler cycle, do the biconnected components have Euler cycles as well?
|
In an undirected graph, can two nodes at an identical distance n from the root of a DFS tree be neighbors in the original graph? I'm thinking no, but I'm not sure (because of back edges)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.