• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

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

Charles Knessl
Published in: Math. Comput. Model. (2008)
Keyphrases
  • small number
  • computational complexity
  • expert systems
  • evolutionary algorithm
  • information retrieval systems