"The computational complexity of the unconstrained limited domino problem ..."

Martin Fürer (1983)

> Home

Details and statistics

DOI: 10.1007/3-540-13331-3_48

access: closed

type: Conference or Workshop Paper

metadata version: 2024-02-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/lam/Furer83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lam/Furer83
Martin Fürer:
The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems). Logic and Machines 1983: 312-319

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.