由 ChatGPT 生成的谜题 Sumplete 的 NP 完备性和物理零知识证明

IF 2 4区 计算机科学 Q3 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE New Generation Computing Pub Date : 2024-07-31 DOI:10.1007/s00354-024-00267-0
Kyosuke Hatsugai, Suthee Ruangwises, Kyoichi Asano, Yoshiki Abe
{"title":"由 ChatGPT 生成的谜题 Sumplete 的 NP 完备性和物理零知识证明","authors":"Kyosuke Hatsugai, Suthee Ruangwises, Kyoichi Asano, Yoshiki Abe","doi":"10.1007/s00354-024-00267-0","DOIUrl":null,"url":null,"abstract":"<p>Sumplete is a logic puzzle generated by ChatGPT in March 2023. The puzzle consists of a rectangular grid, with each cell containing an integer. Each row and column also has an integer called <i>target value</i> assigned to it. The objective of this puzzle is to cross out some numbers in the grid such that the sum of uncrossed numbers in each row and column is equal to the corresponding target value. In this paper, we prove that Sumplete is NP-complete. We also propose a physical zero-knowledge proof protocol for the puzzle using physical cards.</p>","PeriodicalId":54726,"journal":{"name":"New Generation Computing","volume":"214 1","pages":""},"PeriodicalIF":2.0000,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"NP-Completeness and Physical Zero-Knowledge Proofs for Sumplete, a Puzzle Generated by ChatGPT\",\"authors\":\"Kyosuke Hatsugai, Suthee Ruangwises, Kyoichi Asano, Yoshiki Abe\",\"doi\":\"10.1007/s00354-024-00267-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Sumplete is a logic puzzle generated by ChatGPT in March 2023. The puzzle consists of a rectangular grid, with each cell containing an integer. Each row and column also has an integer called <i>target value</i> assigned to it. The objective of this puzzle is to cross out some numbers in the grid such that the sum of uncrossed numbers in each row and column is equal to the corresponding target value. In this paper, we prove that Sumplete is NP-complete. We also propose a physical zero-knowledge proof protocol for the puzzle using physical cards.</p>\",\"PeriodicalId\":54726,\"journal\":{\"name\":\"New Generation Computing\",\"volume\":\"214 1\",\"pages\":\"\"},\"PeriodicalIF\":2.0000,\"publicationDate\":\"2024-07-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"New Generation Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s00354-024-00267-0\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"New Generation Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00354-024-00267-0","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

Sumplete是由ChatGPT于2023年3月生成的一道逻辑谜题。谜题由一个长方形网格组成,每个单元格都包含一个整数。每一行和每一列都有一个被称为目标值的整数。本题的目的是在网格中划掉一些数字,使得每一行和每一列未划掉的数字之和等于相应的目标值。在本文中,我们证明了 Sumplete 的 NP-完备性。我们还提出了一种使用物理卡片的零知识证明协议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
NP-Completeness and Physical Zero-Knowledge Proofs for Sumplete, a Puzzle Generated by ChatGPT

Sumplete is a logic puzzle generated by ChatGPT in March 2023. The puzzle consists of a rectangular grid, with each cell containing an integer. Each row and column also has an integer called target value assigned to it. The objective of this puzzle is to cross out some numbers in the grid such that the sum of uncrossed numbers in each row and column is equal to the corresponding target value. In this paper, we prove that Sumplete is NP-complete. We also propose a physical zero-knowledge proof protocol for the puzzle using physical cards.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
New Generation Computing
New Generation Computing 工程技术-计算机:理论方法
CiteScore
5.90
自引率
15.40%
发文量
47
审稿时长
>12 weeks
期刊介绍: The journal is specially intended to support the development of new computational and cognitive paradigms stemming from the cross-fertilization of various research fields. These fields include, but are not limited to, programming (logic, constraint, functional, object-oriented), distributed/parallel computing, knowledge-based systems, agent-oriented systems, and cognitive aspects of human embodied knowledge. It also encourages theoretical and/or practical papers concerning all types of learning, knowledge discovery, evolutionary mechanisms, human cognition and learning, and emergent systems that can lead to key technologies enabling us to build more complex and intelligent systems. The editorial board hopes that New Generation Computing will work as a catalyst among active researchers with broad interests by ensuring a smooth publication process.
期刊最新文献
Infant Walking and Everyday Experience: Unraveling the Development of Behavior from Motor Development Improvement and Analysis of Peak Shift Demand Response Scenarios of Industrial Consumers Using an Electricity Market Model Chaotic Satin Bowerbird Optimizer Based Advanced AI Techniques for Detection of COVID-19 Diseases from CT Scans Images Dance Information Processing: Computational Approaches for Assisting Dance Composition Intelligent Bayesian Inference for Multiclass Lung Infection Diagnosis: Network Analysis of Ranked Gray Level Co-occurrence (GLCM) Features
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1