Perfect matching in random graphs is as hard as Tseitin (scientific article; zbMATH DE number 7872058)

From MaRDI portal