"The computational complexity of Holant problems on 3-regular graphs."

Peng Yang, Yuan Huang, Zhiguo Fu (2024)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2023.114256

access: closed

type: Journal Article

metadata version: 2023-12-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/YangHF24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/YangHF24
Peng Yang, Yuan Huang, Zhiguo Fu:
The computational complexity of Holant problems on 3-regular graphs. Theor. Comput. Sci. 982: 114256 (2024)

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.