"Perfect Matching for Regular Graphs is AC°-Hard for the General ..."

Elias Dahlhaus, Marek Karpinski (1992)

> Home

Details and statistics

DOI: 10.1016/0022-0000(92)90005-4

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/DahlhausK92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/DahlhausK92
Elias Dahlhaus, Marek Karpinski:
Perfect Matching for Regular Graphs is AC°-Hard for the General Matching Problem. J. Comput. Syst. Sci. 44(1): 94-102 (1992)

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.