Computer Science
Profile Activity
Network profile
103
reputation
3

Pabi

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

0
answers
1
question
~73
people reached

Communities (13)

Top network posts

Top tags (2)

Score 0
Posts 1
Score 0
Posts 1

Top posts (1)

All Questions Answers
Votes Newest
0 Can you always prove the asymptotic bound of a recurrence of the form aT(n/b) + f(n) using the substitution method? Apr 2 '19

Badges (3)

Gold

—

Silver

—

Bronze

3

Rarest