"A polynomial time upper bound for the number of contacts in the HP-model ..."

Rolf Backofen (2004)

> Home

Details and statistics

DOI: 10.1016/S1570-8667(03)00076-5

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jda/Backofen04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/Backofen04
Rolf Backofen:
A polynomial time upper bound for the number of contacts in the HP-model on the face-centered-cubic lattice (FCC). J. Discrete Algorithms 2(2): 161-206 (2004)

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.