Hi everyone,
I am Madhav Wagle. I am an incoming masters student in the CS department at
UCSD with an interest in cs theory. I have contributed to Sage's graph
theory modules previously.
I am interested in contributing to the Big Ell project.
As far as I understand,
given f(n) ≤ c g(n) , for n ≥ n_{0} and some c
We need a structure *Ell(g(n))* that tracks g(n), c and n_{0}
as opposed to O(*g(n)*) which only tracks *g(n)*
The problem description <https://wiki.sagemath.org/GSoC/2021> mentions
"Asymptotic Methods in Analysis" by N. G. de Brujin but there is no
open/free copy of the text. Is there some reference text or implementation
where I can get more detail on the expected behavior of this Notation?
Also would a CS theoretic understanding of the Big Oh notation be
sufficient or some serious analysis background is also needed for this
project?
Thanks,
Madhav
--
You received this message because you are subscribed to the Google Groups
"sage-gsoc" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/sage-gsoc/c821088c-fd26-4d6d-b803-6caea7dca9abn%40googlegroups.com.
