Perfect Matching in Random Graphs is as Hard as Tseitin

Location
Deutsche Nationalbibliothek Frankfurt am Main
Extent
Online-Ressource
Language
Englisch

Bibliographic citation
Perfect Matching in Random Graphs is as Hard as Tseitin ; volume:1 ; year:2022
TheoretiCS ; 1 (2022)

Classification
Informatik

Creator
Austrin, Per
Risse, Kilian

DOI
10.46298/theoretics.22.2
URN
urn:nbn:de:101:1-2023022110335917698728
Rights
Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
14.08.2025, 10:46 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Associated

  • Austrin, Per
  • Risse, Kilian

Other Objects (12)