Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the number of reachable configurations for the chessboard pebbling problem."

Charles Knessl (2008)

> Home

Details and statistics

DOI: 10.1016/J.MCM.2007.02.010

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/mcm/Knessl08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mcm/Knessl08
Charles Knessl:
On the number of reachable configurations for the chessboard pebbling problem. Math. Comput. Model. 47(1-2): 127-139 (2008)

a service of

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.