instruction stringlengths 35 11.4k |
|---|
How to find the minimum (or close to minimum) cost path that visits a subset of nodes within a graph? What algorithms can I use?
I googled and found: http://lcm.csa.iisc.ernet.in/dsa/node181.html
But the problem doesn't look like a minimum-cost spanning trees.
This is because the subset of nodes that I want to visit is... |
I am interested in algorithms that construct continuous curves between two points in such a way that minimizes an energy functional of the curve. What sort of algorithms are most used for such tasks?
More formally, given two points $a$ and $b$, and energy functional $E(C)$, where $C$ is a curve such that $C(0)=a$ and $... |
I have this dataset, and I am using y = (a * x^n) / (b + x^n) Hill function as the model, where a is the limit of the Hill curve, b is the point at which a/2 is reached (for n = 1) and n is the cooperativity or steepness of the curve.
Currently, I am storing all x,y values and computing the parameters a,b,n using black... |
Currently, i working with LDPC for FPGA implementation. I have formed H matrix of size 102X204 (N=204,K=102,M=102,R=0.5). Doubt in Error detection and correction for bigger matrix.
I know that code's error detecting and correcting capability depends on its DISTANCE. For example distance is say 10, then i can correct m... |
I'm rather new to computers and how they work in the microscopic scale, but here's the little bit that I know.
Computers have lots of transistors in them, both in memory and processor, and each transistor has two states, on and off. They are translated to binary equivalents 0 and 1. All data is stored in computers as ... |
For language $M \subset \{0, 1\}^*$ lets denote $And(M) = \#(M\#)^*$ and
$Or(M)=\#\{0,1,\#\}^*\#M\#\{0,1,\#\}^*\#$. We can say that language
has $AND$ ($OR$) property with respect to polynomial
reductions if there exists polynomial reduction from $AND(M)$$(OR(M))$ to
$M$.
Show that each language in $P$ has both prop... |
For $f : V → V$ which is authomorphism of directed graph $G = (V, E)$,
$$\#f = |\{v : f(v) \neq v\}|$$ For graph $G$ we denote: $$\#G =
\max\{\#f : \text{$f$ is isomorphism $G$} \}$$
Prove that if $P = NP$ then function $G\to\#G$ is polynomially
computable.
My problem is that I can't think about isomorphisms.... |
I am trying to calculate the speedup of this, but I am getting the wrong answer:
Assuming that we have a program where we have two execution phases. One phase takes 1 time unit to execute and can only execute sequentially. The other phase takes 3 times units to execute sequentially but can be perfectly parallelized. W... |
This is a problem from a MOOC on computer networking:
We wish to send a message of size $150,000$ bytes over the network. There are four hops, each of length $20$ km and running at $100$ Mb/s. However, before sending we split the message into $1500$ byte packets. What is the end-to-end delay of the message? Use speed ... |
I am using Kruskal's algorithm to build minimum-spanning-trees. I would like to know, given that my total set of edges has size N, if there is a bounding number of edges in the resulting MST, i.e. a size M smaller than N that determines the maximum number of edges in the MST. Or otherwise, if in general no such bounds ... |
I am trying to solve the following recurrence relation :-
$T(n) = T(\sqrt{n}) + n$ using masters theorem.
We can substitute $n = 2 ^ m$
$T(2^m) = T(2 ^ {\frac{m}{2}}) + 2^m$
Now we can rewrite it as
$S(m) = S(\frac{m}{2}) + m$
The big $O$-notation for $S(m)$ will be $O(m)$.
Hence, $T(n) = T(2^m) = S(m) = O(m)$.
So we c... |
Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48-bit jamming signal is 46.4 μs. The minimum frame size is:
a) 94
b) 416
c) 464
d) 512
My approach:- I have read in the book that minimum frame transmission time is atleast twice the round trip time.So by that logic i can say that the answer will b... |
I am referring to this video https://www.youtube.com/watch?v=vgELyZ9LXX4 at 1:08:39 .
$n$ : number of nodes in the tree
$Z_{n,k}$ : Indicator random variable that activates when rank of the root is k
$X_n$ : random variable denoting height of BST
$Y_n$ : random variable denoting $2^{X_n}$
In the video, it is said tha... |
Let $f(n) = (\log n)^n$
and $g(n) = n^2$
By taking a large value, I could make out that $f(n) > g(n)$ .
I want to know if $f(n) \in \Theta(n^2)$ . For proving this, I need to find out the value of $c$ such that
$f(n) \le c \cdot g(n)$ .
How do I find the value of $c$ ? By seeing the function it seems like no $c$ e... |
There is a non-regular language that exists the pumping lemma for regular language?
I didn't find one.
Edit:
From what i understood the pumping lemma does not prove that it is a regular language becuse there are non regular languages that "support" the pumping lemma.
Thanks.
|
Here we see a very interesting attempt to show that $\mathrm{P} \ne \mathrm{NP}$ by Norbert Blum.
Here we see 116 previous attempts at solving P vs. NP.
Here we see the P vs NP problem defined as:
The informal term quickly, used above, means the existence of an algorithm solving the task that runs in polynomial time... |
According to this description of Python's method resolution order (mro), a.k.a. C3 linearization, the algorithm can be described recursively as follows:
L(O) = <O>
L(C) = <C> + merge(L(B1),..., L(Bn), <B1,...,Bn>)
where
O is the class from which every class inherits.
C is a class that inherits directly from B1, ..., ... |
How can I prove this. what is the way? im up to the second last line. and i dont actually know how can x * (1 + y) then the y just disappears into x * 1.
x + x * y = x
x + x * y = (x * 1) + (x * y)
= x * (1 + y)
= x * 1 [THIS LINE]
= x
thanks
|
It is listed as such in wiki, however my literature never refers to it as such.
My gut tells me to follow papers and monographs on the matter, but my concern is that I will make an easily avoidable mistake, or that I simply misunderstood the text.
|
Prove that for each arbitrary set of natural numbers $A$ we have:
$$\{bin(n) | n\in A\} \in BPP \to \{0^n|n\in A\}\in QP$$ where $bin
(n)$ is binary representation of $n$ $$QP = \bigcup_{c\in \mathbb{N}}
DTIME\left(2^{(\log n)^c}\right) $$
I have no idea how to move from probablistic machines to non-probablisiti... |
Ok, the proof is clear. But, if we prove that $BPP \subseteq EXP$ we should show that for every machin in $BPP$ there exists equivalent machine in $EXP$. I cannot see how the $EXP$-machine is equivalent.
If we run machine $A$ on $x$ it can accept a word $x$ with probability $0.5$. Now we can run our $EXP$-machine. I... |
I'm looking to shuffle a list of the elements $a_1,\dots, a_6, \dots, e_1, \dots, e_6$
while keeping two rules:
if I loop though the list and filter out a specific letter or number it should be in order:
$a_1, a_2, a_3 \dots$ or $a_1, b_1, c_1 \dots$
How can I shuffle the list keeping these rules? I'm using python, so ... |
Imagine the following sets :
A = Set( sortedSet(1,2,3), sortedSet(4,8))
B = Set( sortedSet(3,4), sortedSet(5,6,7) )
Where each inner list represent a cluster composed by indexed dots (1,2,3...).
I want to gather cluster sharing the dots sharing the same index into one to get :
Set( sortedSet(1,2,3,4,8), sortedSet(5,6,... |
I have a brief proof about QBF being $\in$ APTIME, which claims that you can use the additional input of the alternation as values for your QBF formula.
And therefore you can accept, if the quantifier less formula $\psi$ is true, given the additional input.
That makes sense, but if you assume $\psi$ in 3-CNF. I could m... |
I am unable to understand why unbalanced partitions in quicksort is actually worse than balanced partitions.
After reading this document it shows that worse case partitions are of the type $(0,(n-1)), (0,(n-2)), (0,(n-3))$ and so on. So the work on every step is $Cn, C(n-1), C(n-2)$ , it actually decreases since $C(n) ... |
I have a question regarding no-regret algorithms (of online learning). As far as I can see, such algorithms allow the absolute regret up to round $n$, which is $R_n$, to grow by $\sqrt{n}$. So, in the limit, the per round regret ($R_n/n$) approximates $0$. Which makes it a no-regret algorithm. The problem is that I can... |
I am a Computer Science student and I study Data Compression now. I read many methods but Golomb-Rice Encoding was not clear for me. I understand the method how it works but in the algorithm there is 'Tunable parameter $M$' that operates with the number that you want to encode. My question is how can I decide what val... |
This question is purely theoretical as I've not been able to find anyone who's done such a thing, so my question is - is it possible, and if not why?
Say you have a short video (CCTV) of a face, or number (car licence) plate, and that video is of too poor quality to discern who that person is or what the number plate s... |
I am interested in data structures that support efficient searching of various kinds.
When I read the Wikipedia page of "search data structure", it says "Useful search data structures allow faster retrieval; however, they are limited to queries of some specific kind". So, obviously, there exists a correlation of one s... |
I've read several sources of information that describe the process of Bayesian Monte Carlo Quadrature but am just not understanding the details enough to be able to implement it.
For instance two sources:
http://mlg.eng.cam.ac.uk/zoubin/papers/RasGha03.pdf
https://www.cs.toronto.edu/~duvenaud/talks/intro_bq.pdf
I get... |
This is a real situation (I hope it's ok that I post this here. If not, please suggest a better home). I have little knowledge of algorithms, but I know I can use one to solve this problem.
I'm looking for an answer, or an online resource that can help, or an algorithm I should research to help me find the route with t... |
Prove that $L$ is closed under Kleene star iff $L=NL$
Hi,
I am trying to solve this exercise, but it is quiet difficult.
Of course first part is very easy:
Let assume that $L=NL$. Lets consider language $A\in L$. We show that also $A^*\in L$. It is easy because we can guess partition of word $w=w_1w_2..w_k$ and lau... |
Could someone explain to me what component(s) are responsible for translating binary into ASCII/UNICODE? For example, is it an assembly program that sets up a 1-1 correspondence between characters and their binary equivalents, which is then loaded into ROM during manufacturing?
|
All tutorials on algorithms show the complexity for the linear search in the unsorted array in the average case as N/2. I understand that the average case means the items in the list are randomly distributed.
Can anyone show how I would arrive at N/2 if I have items randomly distributed? Or does it come out of randoml... |
This solution comes from https://people.eecs.berkeley.edu/~luca/cs172-07/solutions/practicefinal-sol.pdf
Consider the language
$$ EQ_{NFA} = \{ \langle N, N^\prime \rangle \mid N, N^\prime \text{ are NFA's with the same alphabet and } L(N) = L(N^\prime) \} $$ show
that $EQ_{NFA} \in \textbf{PSPACE}$.
(hint: Can you ... |
I am running several machine learning classifiers to predict something from my data. If I visualized the precision and recall tables as a result, is it enough to get clear idea about the proposed mdel? or do I have to consider the accuracy table in order to cover the issue?
I am running 3 different classifiers (svm, pe... |
A set $S$ of natural numbers is Recursively Enumerable if there exists a Turing machine which enumerates them, i.e. given no input, outputs the elements of $S$ in increasing order (never halting if $S$ is infinite).
Now, suppose my set has a different kind of machine: Instead of enumerating the set, it takes an intege... |
There are given:
alphabet $Σ$ with some symbols $a,b$.
list of forbidden patterns
Result: Is there exists word of form $a\Sigma^*b$ such that it doesn't contains (as subword) any of word from
list (list contains many words, expressed by patterns). Show that
this problem is in $PSPACE$.
Example to better understa... |
From what I understand, natural language are too complicated to be generated by a context-free grammar, yet parsing a context-sensitive grammar is too computationally demanding for our brain to be continuously performing. So it seems that if our brain indeed has a "syntax" module to parse sentences as Chomsky claims it... |
I have a set of items. For each item, there is a list of buyers I can sell it to and a corresponding price they will pay me. For example:
item1: item2: item3: item4:
john: 17 john: 19 bob: 42 ...
bob: 23 mick: 22 mick: 44
sue: 19 liz: 24 sue: 38
liz: 20... |
I have a directed graph created in matlab. I am trying to print all paths from root to leaves. I used stack to implement my algorithm but it seems very slow when I have large number of nodes and edges.
Is it possible to solve this problem in O(nlogn) time ?
%This is my graph:
output =
edges: {[0 1] [0 2] [1 3] [... |
Fiorini, Massar, Pokutta, Tiwary and De Wolf (Exponential Lower Bounds for Polytopes in Combinatorial
Optimization, Journal of the ACM 62(2):article 17, 2015; PDF, ArXiv) show any linear program that solves travelling salesman needs super-polynomially many constraints.
Suppose $P=NP$ by 'some' method then we can solve ... |
Let us assume I have a Program P running on remote computer generating output O. Without trusting the remote environment and not having to verify the output O, is there is a way to validate that Program P has indeed been executed and resulted in output O ?
Let me know if the question is too vague. I will clarify.
|
Please help me to prove:
If $f, g ∶ \mathbb{N} \rightarrow \mathbb{N}$ and $f$ and $g$ are increasing $(f(n+1)>f(n),g(n+1)>g(n)$).
Need to prove $g=O(f)$ or $f=O(g)$.
Thanks
|
I need to do a weighted matching between two sets (say students and professors). The set of students is much larger than set of professors. So multiple students can be matched to professors. However, each professor also has a minimum number of students he needs. So even though all students maybe matched best with one p... |
I have a graph $G=(V,E)$ that consists of many disconnected directed subgraphs, some of them may be cyclic. (Basically a "forest" consisting of directed trees and some directed disconnected cyclic graphs added into it).
I want to find all of these disconnected subgraphs and turn them into stars given by the key of the... |
Theorem states that every problem in $\mathsf{NP}$ can be reduced to another $\mathsf{NP}$-complete problem in polynomial time. Also you can only make a problem polynomially longer using polynomial time.
Thus SAT of length $n$ can be reduced to knapsack with length $n^k$ for some fixed $k\in\mathbb{R}^+$. We don't need... |
Does every 3CNF propositional formula has an equivalent 2CNF propositional formula?
Definitions:
3CNF propositional formula is conjunctive normal form propositional formula, which is just conjunction $\land$ of clauses, where each clause is disjunction $\lor$ of at most 3 literals, where each literal is just boolean va... |
Are out there, any programming languages that are not defined algorithmically so that we can call them "constructed languages" but not "formal languages"? Are there any discussions or papers on that topic? It seems pretty hard to develop a compiler for this kind of languages.
|
In the best case of quicksort the depth of the call stack is measured by $\lceil\log_2 n\rceil$ if I am not wrong. What would be the formula for calculating the depth of the call stack in case of an average case of quick sort, for lets say the partitions are always broken using the ration 1:9 or 1:4 every time.
How wo... |
$$L=\{\langle G\rangle \#\langle H\rangle : H, G \text{ are directed isomorphic graphs }\}$$
$\langle G\rangle$ is adjacency matrix written row by row.
Show that if $L\in BPP$ then also $L\in RP$.
Can you help me ?
I have no idea how to do it.
|
Let $G = (V, E)$ be a digraph, and consider the set $\left\{ v \in V \; \middle| \; \left(\{v\} \times V \right) \cap E \neq \varnothing \right\}$, the set of vertices which form edges with other vertices; or if you will, the set of "heads of edges".
Is there a commonly-used term for this set?
|
I use a very simple neural network to make classification between classes. Once my ANN is trained I'm able to present new and unknown data, and get a good classification.
Is there a simple way to reverse the process and create an artificial data, knowing at which class it should belong ?
What would be the method name... |
This is related to the issue asked about in this other question.
For the sake of this question, let's assume that we have a variable v that can have any value from the set of values
"a", "b", "c", ..., "z"
In this case then the programmers wants to have specific code executed when the value of v is not "x", "y", or "... |
What is the relation of complexity class $L^L$ to other complexity classes?
(Here $L^L$ is the complexity class of decision problems solvable by a TM in logspace with an oracle for a language in logspace.)
|
Does every 3CNF propositional formula has an equisatisfiable 2CNF propositional formula?
|
Given a bipartite graph $(X,Y,E)$, in which there is no perfect matching, I want to find a smallest subset that violates Hall's condition, i.e., a minimum-cardinality set
$S \subseteq X$ for which $|N(S)|<|S|$.
This problem is the optimization version of a former question Finding a subset in bipartite graph violating ... |
Let $\Sigma=\{a,b\}$. Why is the concatenation of any language with $\Sigma^*$ always regular? I found a problem where $(a+b)^*$concatenated with $a^nb^n$ was regular?
|
More specifically :
lets say i have 5 taxis , each available for booking at t=0; i have two days (48 hrs) with me how can I maximise their booking . I may not be able to clarify the question , this was some interview question but the context is how to schedule the taxis for max profit. I gave a algo to run at t=0 but i... |
I'm reading about memory management in Operating System Concepts, by A. Silberschatz. The author says:
[...] the user process by definition is unable to access memory it does not own.
It has no way of addressing memory outside of its page table, and the table
includes only those pages that the process owns.
Then,... |
In an answer to the problem of determining whether or not a point lies inside a given convex hull, a thesis is mentioned, which says :
For repeated queries with preprocessing allowed, we develop a special
method that relies on the convexity of the polygon. Recalling Theorem
3.5, the vertices of a convex polygon oc... |
I have two search algorithms (for determining if an element $x$ is in a list $A$ of length $n$):
(1) Pick a random index $i$ from $L = [1, \ldots n]$. If $A[i] = x$, terminate. Otherwise, pick a new random index $i$, still in the list $L = [1, \ldots , n]$. Repeat until we've either found a $j$ such that $A[j] = x$ or ... |
Weighted 2SAT asks if it is possible to satisfy the formula with at most $k$ variables set as positive/negative. Trivially, every instance must be in 2CNF. It is known to be $\mathsf{NP}$-complete.
We have following additional restriction: each variable appears twice as positive and once as negative or vice versa.
Exam... |
I came across this algorithm in a book, and have been struggling to understand the basic idea. The books says it uses backtracking to print all possible permutations of the characters in a string. In Python, the algorithm is given as:
def bitStr(n, s):
if n == 1: return s
return [digit + bits for digit in bitSt... |
Given that $L \subseteq NL \subseteq P \subseteq NP \subseteq PSPACE$ and that it is commonly believed that all these inclusions are strict can you provide examples of problems that are believed to be in each class and not in the preceding ones?
To try to narrow the scope of the question, could you provide paradigmatic... |
Ok, I really need help because I have read in so many books but still don't understand the complexity class NP.
These are the books:
Theoretische Informatik; Katrin Erk, Lutz Priese (german)
Grundkurs: Theoretische Informatik; Gottfried Vossen, Kurt-Ulrich Witt (german)
Theoretische Informatik; Ingo Wegener (german)
... |
$f$ is differentiable (continous) and analytic function.
If $x\in\mathbb{R} \land 0\le x\le1$ then $f(x)$ is computable, $f(x)\in\mathbb{R}$ and $0\le f(x)\le1$.
I have a conjecture that it is possible in O(1) constant time to find the maximum of $f$ in the interval [0,1] by using quantum computer.
Let some qubit be th... |
I have the following problem and would like an orientation on which algorithms I can try to adapt to solve it in the best possible way.
SCENARIO
A company has a warehouse where it stores several products. A product can be stored in several packages, for example:
1 box with 10 units
1 box with 3 boxes of 10 units
1 box... |
How can we construct TMs such that it accepts(Give description only):
a + b = c
a . b = c
Input is of the form a#b#c.
a,b and c belongs to {0,1}* and are positive binary unsigned integers.
I know that we can construct TMs if the input has unary representation but how to solve if it has binary representation?
|
Reversible programs with finite execution steps are well studied. For example, a Turing machine whose transitions are reversible and halts can be executed backwards consuming its tape in the reverse order. A variant of Turing machines with distinct input, output, and work tapes can be similarly executed in reverse to c... |
Can we construct minimum spanning tree for an undirected graph with distinct weights using bfs or dfs?
I have gone through many answers but each answer says something different and I am not convinced.
|
My algorithm solves the following problem:
$n\in\mathbb{N} \land n\ge1$
$\{v_1, \ldots , v_n\}\subset\mathbb{Q}$
$
\begin{eqnarray}
\left\{
\begin{array}{}
\square\cdot\square\cdot\square = 0 \\
\vdots \\
\square\cdot\square\cdot\square = 0 \\
\end{array}
\right.
\end{eqnarray}
$
$\square\in\{v_1,\ldots,v_n,1-v_1,\ldot... |
Why is that the page size equals the size of one cache way?
My book states "A direct-mapped cache cannot be bigger than a page".
|
From what I understand, async/await enables to avoid the "callback pyramid of doom".
Let's say that I have funcA(), funcB() and funcC() that are async functions, now if I do something like that:
func someFunction() -> T {
let myValueA = await funcA()
let myValueB = await funcB()
let myValueC = await funcC()
return do... |
Let's check together whether the TSP-decision problem is NP-complete. Maybe it will help me to understand things better.
Question for TSP-decision problem: Given n cities and a tour from length $k$. The traveller starts at an arbitrary city, visits every other city just once and returns to the starting point. Does a t... |
The inner loop of this pseudocode runs only for the divisors of n
for i=1 to n:
if(n%i==0):
for j=1 to n:
Do something in constant time
If I can get a bound on the number of divisor of n(The condition in the if statement) then I can get its time complexity.Please Help ?
|
As a project, I'm trying to construct a P2P auction web application with paxos in a high latency environment. The idea is that each user visiting the website will keep a small log file with the interested item and current price/bid. Each submitted bid will use a client-sided paxos algorithm to contact nodes all nodes t... |
Suppose I have set of time records as follows
08:00 - 12:00
10:00 - 12:00
08:00 - 13:00
13:00 - 19:00
12:00 - 17:00
Now I want to select set of time records that are not overlapping and has the largest sum.
08:00 - 13:00 + 13:00 - 19:00 = 12hours
My current approach is
Sort the records by start time
Select the fir... |
This Screenshot is taken from William Stalling's Operating Systems book.
My doubt is that Bounded wait is not satisfied by this solution.
For example: P0 and P1 both want to enter critical section and set their flags to true.
flag[0] = true
flag[ 1] = true
Both p0 and p1 enter while loop, p0 wins the race process P1 ... |
Input: A set of points P(x,y). There are two versions of it - Px, sorted by x and Py, sorted by y.
Output: The two even halves of Px, sorted by y.
The trick here is that it has to work in linear time, otherwise, it's rather useless. What I've come up with so far is finding the midpoint of Px, let's call it Px[mid] and ... |
I'm learning the book named Data Structures & Algorithms in Python.
On Page 557-558, there is a proof of the expected running time of randomized qucick-sort. I have some problems confusing me some days. I will note them in bold form.
Here's orginal text:
Proposition 12.3: The expected running time of randomized quick-... |
I don't think I'm able to solve this using the master's theorem, and solving separately doesn't seem to make sense. How does one go about solving this recursive relation?
T(n)= 2T(n/2) + 3T(n/5) +n
|
Below is an excerpt from Khan Academy's Quick Sort Analysis page.
In the average case of quicksort they assume that each time the partition function breaks the input array into the ratio 1:3 each time.
So why is it easier to assume $\log_4 n$ levels when the $n$ elements are being partitioned ? Why not assume it to b... |
This could relate to different applications, but my application of interest is in similarity-search systems based on high-dimensional feature vectors. In these systems, since search based on Euclidean distance is costly, the vectors are encoded as binary vectors. Then the search is done based on Hamming distance compu... |
I am newbie with machine learning. In order to learn more I decided to try solving a specific problem/game that I have in mind. The problem is the following:
I have a list of $N$ items which are auctioned in a random sequence. There are $n$ participants to the auction. They have a fixed budget and $M$ items to buy. Eac... |
I would like to to draw a graph where every edge $e_m$ has a predefined length of $l$. Given that the graph is small and sparse, it should be feasable. However, I did not manage to find an algorithm which does this (or one that is suitable to modify) yet I'm sure that this is a solved problem. Does anyone know of such ... |
I have a set of leaf-labeled trees. I want to concatenate them into a single leaf labelled tree in such a way that the height of the resulting tree is smallest possible.
Can somebody please help me to generate an algorithm for this task,
with good performance?
Leaf labelled tree is a tree in which all the data is hel... |
This is a Hackerrank challenge
$Knight$ is a chess piece that moves in an L shape. We define the possible moves of $Knight(a,b)$ as any movement from some position $(x_1, y_1)$ to $(x_2, y_2)$ satisfying either of the following:
$x_2 = x_1 \pm a$ and $y_2 = y_1 \pm b$, or
$x_2 = x_1 \pm b$ and $y_2 = y_1 \pm a$
Giv... |
According to Cayley's formula, we have number of spanning trees on a complete graph as n^n-2 and number of labelled trees with n vertices as n^n-2
If the tree is rooted then in each tree we can choose a root in n ways so total number of rooted labelled trees is n^n-1.
Here when computing the total number for rooted lab... |
I'm studying for a final and when looking for the shortest path in a graph from one vertex to another, what is meant by k-skips?
One website defines it as the ability to change the weight of one edge to zero, as if you don't include it in the path distance.
Another one defines it as:
$P*$ is a k-skip shortest path fro... |
Let $f$ be a computable function in $PSPACE$ It is true that Turing machine that computes $f$ can produce only $EXP$-size output at most. I see that $\log 2^n = n$ we can "control" the output. But, it doesn't convince me.
Please explain
|
What language is in $P/Poly \setminus P$? I was thinking of it by hours but I cannot come with an idea. Please help.
|
I'm trying to get some notion of how "many" recursively enumerable sets there are.
Here's one way of formalizing the question: consider $S =\{q: q\in Q\cap [0,1]\}$ and $R\subset S$ the set of recursively innumerable subsets of $S$.
What is the measure of $R$? My intuition is that it is 0 (i.e. a given set is almost su... |
In interval scheduling, the greedy solution which maximizes the schedule that contains the largest number of "compliant intervals" involves initially sorting the list of intervals in ascending order by the end-times/point of each interval.
What confuses me, is if two or more intervals have the same ending time.
When p... |
I am writing to see if someone can point me to the original citation (assuming that a single work can be pointed to) for the single-source shortest path problem in directed-acyclic graphs (DAGs). Below is one candidate citation, which I came up with after digging around on google scholar (somehow, though, 1977 already ... |
Silly question. I was wondering if the measure of "variance" is taken into account when the analysis of an algorithm is performed (asymptotic). In general best-case,worst-case,average-case are taken into account, even for more complicated analysis. However is the variance actually used sometimes?
I can imagine that in ... |
Fréchet distance tells how similar two curves are. Now let's say I have two curves A and B, both represented in several discrete coordinate x, y points. And the fréchet distance between A and B is d. What technique can I employ to find another curve that has d/2 fréchet distance from both curves and has a total euclide... |
I took a tangent from a student
project
I had done a number of years ago and spent some time studying distance
functions.
(please note that the above link contains the full question with links as I don't have sufficient reputation to post more than two links)
I found this textbook on data
mining which includes a
chapte... |
I'm dealing with a slight variation on a classic matching problem on sets $A$ and $B$), where:
Set $A$ has an incomplete set of preferences (not all of $B$ is included)
Set $B$ has no preferences whatsoever.
I want to find an $A$-optimal matching (e.g, for any $(a_1 \rightarrow b_1), (a_2 \rightarrow b_2)$, then eith... |
forest : set of disjoint trees.
So a connected forest is a forest, a tree, a spanning forest and a spanning tree.
Is that correct?
Edit: disjoint trees in the forest are connected by single edge, so as to make the forest connected
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.