发布求助
文献互助 智能选刊 最新文献

Bull. EATCS最新文献

筛选
英文 中文
A tutorial for computer scientists on finite extensive games with perfect information 为计算机科学家提供的具有完全信息的有限扩展游戏教程
Bull. EATCS Pub Date : 2022-04-19 DOI: 10.48550/arXiv.2204.08740
K. Apt, Sunil Simon
{"title":"A tutorial for computer scientists on finite extensive games with perfect information","authors":"K. Apt, Sunil Simon","doi":"10.48550/arXiv.2204.08740","DOIUrl":"https://doi.org/10.48550/arXiv.2204.08740","url":null,"abstract":"We provide a self-contained introduction to finite extensive games with perfect information. In these games players proceed in turns having, at each stage, finitely many moves to their disposal, each play always ends, and in each play the players have complete knowledge of the previously made moves. Almost all discussed results are well-known, but often they are not presented in an optimal form. Also, they usually appear in the literature aimed at economists or mathematicians, so the algorithmic or logical aspects are underrepresented.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134481883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Regular Languages: To Finite Automata and Beyond Succinct Descriptions and Optimal Simulations 正则语言:到有限自动机和超越简洁描述和最优模拟
Bull. EATCS Pub Date : 2020-01-31 DOI: 10.13130/PRIGIONIERO-LUCA_PHD2020-01-31
Luca Prigioniero
{"title":"Regular Languages: To Finite Automata and Beyond Succinct Descriptions and Optimal Simulations","authors":"Luca Prigioniero","doi":"10.13130/PRIGIONIERO-LUCA_PHD2020-01-31","DOIUrl":"https://doi.org/10.13130/PRIGIONIERO-LUCA_PHD2020-01-31","url":null,"abstract":"It is well known that regular (or Type 3) languages are equivalent to finite automata. Nevertheless, many other characterizations of this class of lan- guages in terms of computational devices and generative models are present in the literature. For example, by suitably restricting more general models such as context-free grammars, pushdown automata, and Turing machines, that characterize wider classes of languages, it is possible to obtain formal models that generate or recognize regular languages only. These restricted formalisms provide alternative representations of Type 3 languages that may be significantly more concise than other models that share the same express- ing power. The goal of this work is to provide an overview of old and recent re- sults on these formal systems from a descriptional complexity perspective, that is the study of the relationships between the sizes of such devices. We also present some results related to the investigation of the famous ques- tion posed by Sakoda and Sipser in 1978, concerning the size blowups from nondeterministic finite automata to two-way deterministic finite automata.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128011751","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Splicing 拼接
Bull. EATCS Pub Date : 2019-11-29 DOI: 10.1007/978-1-4020-6754-9_16003
G. Paun
{"title":"Splicing","authors":"G. Paun","doi":"10.1007/978-1-4020-6754-9_16003","DOIUrl":"https://doi.org/10.1007/978-1-4020-6754-9_16003","url":null,"abstract":"","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115693547","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 208
Who needs category theory? 谁需要范畴论?
Bull. EATCS Pub Date : 2018-01-31 DOI: 10.29007/4dr3
A. Blass, Y. Gurevich
{"title":"Who needs category theory?","authors":"A. Blass, Y. Gurevich","doi":"10.29007/4dr3","DOIUrl":"https://doi.org/10.29007/4dr3","url":null,"abstract":"In mathematical applications, category theory remains a contentious issue, with enthusiastic fans and a skeptical majority. In a muted form this split applies to the authors of this note. When we learned that the only mathematically sound foundation of topological quantum computing in the literature is based on category theory, the skeptical author suggested to \"decategorize\" the foundation. But we discovered, to our surprise, that category theory (or something like it) is necessary for the purpose, for computational reasons. The goal of this note is to give a high-level explanation of that necessity, which avoids details and which suggests that the case of topological quantum computing is far from unique.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115045214","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Space in Weak Propositional Proof Systems 弱命题证明系统中的空间
Bull. EATCS Pub Date : 2018-01-11 DOI: 10.1007/978-3-319-73453-8
Ilario Bonacina
{"title":"Space in Weak Propositional Proof Systems","authors":"Ilario Bonacina","doi":"10.1007/978-3-319-73453-8","DOIUrl":"https://doi.org/10.1007/978-3-319-73453-8","url":null,"abstract":"","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124765180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Optimization Techniques for Algorithmic Debugging 算法调试的优化技术
Bull. EATCS Pub Date : 2017-06-20 DOI: 10.4995/thesis/10251/68506
David Insa, Josep Silva
{"title":"Optimization Techniques for Algorithmic Debugging","authors":"David Insa, Josep Silva","doi":"10.4995/thesis/10251/68506","DOIUrl":"https://doi.org/10.4995/thesis/10251/68506","url":null,"abstract":"Nowadays, undetected programming bugs produce a waste of billions of dollars per year to private and public companies and institutions. In spite of this, no significant advances in the debugging area that help developers along the software development process have been achieved yet. In fact, the same debugging techniques that were used 20 years ago are still being used now. Although some alternatives have appeared, they are still a long way until they become useful enough to be part of the software development process. One of such alternatives is Algorithmic Debugging, which abstracts the information the user has to investigate to debug the program, allowing them to focus on what, rather than how, is happening. This abstraction comes at a price: the granularity level of the bugs that can be detected allows for isolating wrongly implemented functions, but which part of them contains the bug cannot be found out yet. This work is a short introduction of some published papers that focus on improving Algorithmic Debugging in many aspects. Concretely, the main aims of these papers are to reduce the time the user needs to detect a programming bug as well as to provide the user with more detailed information about where the bug is located.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116978088","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Zero-One Laws 0 - 1法律
Bull. EATCS Pub Date : 2017-01-05 DOI: 10.1142/9789812794499_0022
Yuri Gurevich
{"title":"Zero-One Laws","authors":"Yuri Gurevich","doi":"10.1142/9789812794499_0022","DOIUrl":"https://doi.org/10.1142/9789812794499_0022","url":null,"abstract":"","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123951180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
The 1966 International Congress of Mathematicians: A micro-memoir 1966年国际数学家大会:微观回忆录
Bull. EATCS Pub Date : 2016-10-13 DOI: 10.3233/fi-222122
Y. Gurevich
{"title":"The 1966 International Congress of Mathematicians: A micro-memoir","authors":"Y. Gurevich","doi":"10.3233/fi-222122","DOIUrl":"https://doi.org/10.3233/fi-222122","url":null,"abstract":"Why the memoir? Well, the author of the scheduled article became unwell. (He should be up and running soon, and his article will appear at some later time.) Facing the prospect of missing an issue, I thought about what I can do in a few days before the deadline. It occurred to me that 2016 is the 50th anniversary of the 1966 International Congress of Mathematicians. Maybe the impressions of a young Soviet mathematician would be of interest to at least some of the readers.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115525708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Twenty Lectures on Algorithmic Game Theory 算法博弈论二十讲
Bull. EATCS Pub Date : 2016-08-30 DOI: 10.1017/cbo9781316779309
T. Roughgarden, K. Iwama
{"title":"Twenty Lectures on Algorithmic Game Theory","authors":"T. Roughgarden, K. Iwama","doi":"10.1017/cbo9781316779309","DOIUrl":"https://doi.org/10.1017/cbo9781316779309","url":null,"abstract":"Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125172702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 169
Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life 书的介绍:算法的力量，灵感和日常生活中的例子
Bull. EATCS Pub Date : 2016-02-01 DOI: 10.5860/choice.51-5648
G. Ausiello, R. Petreschi
{"title":"Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life","authors":"G. Ausiello, R. Petreschi","doi":"10.5860/choice.51-5648","DOIUrl":"https://doi.org/10.5860/choice.51-5648","url":null,"abstract":"Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125767796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信