External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Maze Generation Problem is NP-complete

Mario Alviano. The Maze Generation Problem is NP-complete. In Alessandra Cherubini, Mario Coppo, Giuseppe Persiano, editors, Theoretical Computer Science, 11th Italian Conference, ICTCS 2009, Cremona, Italy, September 28-30, 2009, Proceedings. pages 12-18, 2009.

Abstract

Abstract is missing.

runs on