盒子里的蛇问题

ACM SE '10 Pub Date : 2010-04-15 DOI:10.1145/1900008.1900079

K. Krafka, W. Potter, T. Horton

{"title":"盒子里的蛇问题","authors":"K. Krafka, W. Potter, T. Horton","doi":"10.1145/1900008.1900079","DOIUrl":null,"url":null,"abstract":"The Snake-in-the-Box problem finds its roots in graph theory and computer science with applications in electrical engineering, coding theory, analog-to-digital conversion, disjunctive normal form simplification, electronic combination locking, and computer network topologies. This fascinating problem has puzzled scholars for over 50 years, but research has produced steady progress. Here, we provide an overview of the problem, its history, and current research, including a potential solution.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"The Snake-in-the-Box problem\",\"authors\":\"K. Krafka, W. Potter, T. Horton\",\"doi\":\"10.1145/1900008.1900079\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Snake-in-the-Box problem finds its roots in graph theory and computer science with applications in electrical engineering, coding theory, analog-to-digital conversion, disjunctive normal form simplification, electronic combination locking, and computer network topologies. This fascinating problem has puzzled scholars for over 50 years, but research has produced steady progress. Here, we provide an overview of the problem, its history, and current research, including a potential solution.\",\"PeriodicalId\":333104,\"journal\":{\"name\":\"ACM SE '10\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM SE '10\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1900008.1900079\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SE '10","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1900008.1900079","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 16

摘要

盒子里的蛇问题的根源在于图论和计算机科学，在电子工程、编码理论、模数转换、析取范式简化、电子密码锁和计算机网络拓扑中的应用。这个令人着迷的问题困扰了学者们50多年，但研究取得了稳步进展。在这里，我们提供了一个问题的概述，它的历史，和目前的研究，包括一个潜在的解决方案。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The Snake-in-the-Box problem

The Snake-in-the-Box problem finds its roots in graph theory and computer science with applications in electrical engineering, coding theory, analog-to-digital conversion, disjunctive normal form simplification, electronic combination locking, and computer network topologies. This fascinating problem has puzzled scholars for over 50 years, but research has produced steady progress. Here, we provide an overview of the problem, its history, and current research, including a potential solution.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ACM SE '10

自引率

0.00%

发文量