search

qitianwu / SGFormer

The official implementation for NeurIPS2023 paper "SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations"
213 stars 18 forks source link

About time complexity #9

Closed Tai-Xinwei closed 7 months ago

Tai-Xinwei commented 7 months ago

Thank you very much for your outstanding contribution in the field of graph transformer. I meet a question of SGFormer. Shouldn't the time complexity of equation(3) be $O(N*N)$ because of the product of $K^T and V$? Is there anything wrong with my understanding? I want to figure out it ! Thank U!

Tai-Xinwei commented 7 months ago

Oh! Sorry,I have made a mistake!