Computer Science
Highheath's user avatar
Highheath's user avatar
Highheath's user avatar
Highheath
  • Member for 2 years
  • Last seen this week
Profile Activity
Stats
682
reputation
4k
reached
23
answers
0
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
2
silver badges
7
bronze badges
Top tags
View all tags
15
Score
7
Posts
30
Posts %
13
Score
5
Posts
22
Posts %
10
Score
8
Posts
35
Posts %
9
Score
2
Posts
9
Posts %
7
Score
2
Posts
9
Posts %
5
Score
4
Posts
17
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
7
How does Dijkstra's problem 1 (tree of minimal total length) work and what does it do?
Jun 21, 2021
answer
4
Two-color hitting set
Mar 13, 2021
answer
3
Scott Aaronson's Proof of $\textbf{BPP} \subset \textbf{P/poly}$
Mar 22, 2021
answer
3
Why NP is not certain subset in P/poly?
Mar 9
answer
2
Subset of nodes such that all nodes of a graph are adjacent
Mar 12, 2021
answer
2
Is the inverse of MST cut property true? Why?
Apr 2, 2021
answer
2
Partition of a $k$-partite graph to minimal number of connected sets
Jun 21, 2021
answer
2
tautology vs satisfiability
Jul 26, 2021
answer
2
How to determine if a set of edges is an edge cut of a graph?
Feb 25
answer
1
Does any graph based optimization problem, which have a greedy algorithm, has guarantee that there exist an order which give the optimum
Mar 21, 2021

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.