# Time complexity of exponentiating s-sparse matrices

Could someone suggest me a reference which discusses the time complexity of algorithms meant for exponentiating (finding $$e^A$$ approximately given $$A$$) s-sparse matrices, along with their error rates?

P.S: I'm mostly interested in Hermitian matrices $$A$$.