All Stories

  1. Computational and Proof Complexity of Partial String Avoidability

    Article • ACM Transactions on Computation Theory, January 2021, ACM (Association for Computing Machinery)

    Mr. Vsevolod V Oparin

  2. Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles

    Article • Fundamenta Informaticae, August 2016, IOS Press

    Mr. Vsevolod V Oparin