Computer Science
Highheath's user avatar
Highheath's user avatar
Highheath's user avatar
Highheath
  • Member for 2 years, 9 months
  • Last seen this week
Profile Activity
Stats
802
reputation
6k
reached
29
answers
0
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
3
silver badges
8
bronze badges
Top tags
View all tags
16
Score
7
Posts
24
Posts %
15
Score
8
Posts
28
Posts %
13
Score
9
Posts
31
Posts %
8
Score
2
Posts
7
Posts %
6
Score
4
Posts
14
Posts %
6
Score
2
Posts
7
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
6
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
3
How are closures supposed to interact with variable binding and resolving?
Aug 2
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 convert any recursive solution to a Dynamic programming table? Is there any tricks/tips to follow?
Aug 12, 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.