Perfect Matching in Random Graphs is as Hard as Tseitin.

Per Austrin Kilian Risse

Published in: CoRR (2022)

Keyphrases

random graphs
semidefinite
graph theoretic
community structure
phase transition
small world
markov chain
semidefinite programming