"Computational Complexity of the Extended Minimum Cost Homomorphism Problem ..."

Hannes Uppman (2014)

> Home

Details and statistics

DOI: 10.4230/LIPICS.STACS.2014.651

access: open

type: Conference or Workshop Paper

metadata version: 2022-01-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/stacs/Uppman14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/Uppman14
Hannes Uppman:
Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains. STACS 2014: 651-662

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.