All Stories

  1. Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism

    Article • ACM Transactions on Computational Logic, April 2019, ACM (Association for Computing Machinery)

    Oleg Verbitsky