Given an $n$ bit integer quadratic sieve takes $L(\frac12,1+o(1))$ time and number field sieve takes $L(\frac13,1.922)$ time where $L$ notation is given in https://en.wikipedia.org/wiki/L-notation.
What are the theoretical memory requirements for these two sieving techniques, specifically for the relation collection and the sparse matrix inversion stages?
