Computer Science
Profile Activity
Network profile
327
reputation
4
11

matheuscscp

Apparently, this user prefers to keep an air of mystery about them.

1
answer
6
questions
~20k
people reached
  • Member for 5 years, 11 months
  • 64 profile views
  • Last seen Nov 16 '20 at 5:53

Communities (7)

Top network posts

Top tags (17)

Score 1
Posts 2
Posts % 29
Score 1
Posts 2
Score 1
Posts 1
Score 0
Posts 2
Score 0
Posts 1
Score 0
Posts 1
View all tags →

Top posts (7)

All Questions Answers
Votes Newest
4 If f(n) = O(g(n)), then is log(f(n)) = O(log(g(n)))? May 19 '15
4 Proof of 0/1 knapsack optimal substructure May 15 '16
4 Segment trees with insertion/deletion Jun 1 '15
4 Greedy algorithm correctness proof for “Elegant Permuted Sum” (UVa 11158) Jun 24 '15
2 DPLL time complexity analysis Aug 10 '15
2 Improve minimum spanning tree with new edge, with better running time than O(|V|)? Aug 26 '15
1 Dominator Tree for DAG Jan 13 '17

Badges (15)

Gold

—

Silver

4

Rarest

Bronze

11

Rarest

View all badges →

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.