@article{article, title = {{Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism}},
publisher = {{Association for Computing Machinery (ACM)}},
url = {{http://dx.doi.org/10.1145/3303881 }},
year = {{2019}},
month = {{3}},
author = {{Verbitsky O and Zhukovskii M}},
doi = {{10.1145/3303881}},
volume = {{20}},
journal = {{ACM Transactions on Computational Logic}},
issue = {{2}},
pages = {{1-18}},
note = {{Accessed on 2025/07/12}}}