User Slim Shady - Computer Science Stack Exchange

Slim Shady

Member for 2 years, 8 months
Last seen more than a week ago

Network profile

155 Reputation

Post Time Graph

+10

Jan 14, 2022

upvote +10

Why is $\mathcal{D}^m(\{S:L_{(\mathcal{D},f)}(A(S))\gt \epsilon\})\leq \mathcal{D}^m\left(\bigcup^4_{i=1}F_i\right)$ true?

+2

Oct 19, 2021

accept +2

Show that for a singly-connected graph the number of edges $E$ must be equal to the number of vertices minus $1$, $E=V-1$

+10

Oct 14, 2021

upvote +10

Show that for a singly-connected graph the number of edges $E$ must be equal to the number of vertices minus $1$, $E=V-1$

+22

Aug 17, 2021

Loading…

+110

Aug 16, 2021

Loading…