The complexity of combinatorial problems with succinct input representation

詳細情報 詳細情報について

• CRID

  1360011144516451328

• DOI

  10.1007/bf00289117

• ISSN

  14320525

  00015903

• Web Site

  http://link.springer.com/content/pdf/10.1007/BF00289117.pdf

  http://link.springer.com/article/10.1007/BF00289117/fulltext.html

  http://link.springer.com/content/pdf/10.1007/BF00289117

• データソース種別

  • Crossref