https://kth.diva-portal.org/smash/record.jsf?pid=diva2:1697938
Perfect Matching in Random Graphs is as Hard as Tseitin
perfectmatchingrandomgraphshard
https://kth.diva-portal.org/smash/record.jsf?faces-redirect=true&language=no&searchType=SIMPLE&query=&af=%5B%5D&aq=%5B%5B%5D%5D&aq2=%5B%5B%5D%5D&aqe=%5B%5D&pid=diva2%3A1701110&noOfRows=50&sortOrder=author_sort_asc&sortOrder2=title_sort_asc&onlyFullText=false&sf=all
On bounded depth proofs for Tseitin formulas on the grid; revisited
the gridboundeddepthproofsformulas
https://kth.diva-portal.org/smash/record.jsf?faces-redirect=true&language=sv&searchType=SIMPLE&query=&af=%5B%5D&aq=%5B%5B%5D%5D&aq2=%5B%5B%5D%5D&aqe=%5B%5D&pid=diva2%3A1701110&noOfRows=50&sortOrder=author_sort_asc&sortOrder2=title_sort_asc&onlyFullText=false&sf=all
On bounded depth proofs for Tseitin formulas on the grid; revisited
the gridboundeddepthproofsformulas