"Perfect Matching in Random Graphs is as Hard as Tseitin."

Per Austrin, Kilian Risse (2022)

> Home

Details and statistics

DOI: 10.46298/THEORETICS.22.2

access: open

type: Journal Article

metadata version: 2023-01-10

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/theoretics/AustrinR22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/theoretics/AustrinR22
Per Austrin, Kilian Risse:
Perfect Matching in Random Graphs is as Hard as Tseitin. TheoretiCS 1 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.