| 书目名称 | Mathematical Foundations of Computer Science 2013 | | 副标题 | 38th International S | | 编辑 | Krishnendu Chatterjee,Jirí Sgall | | 视频video | | | 概述 | Fast conference proceedings.State-of-the-art report.Up to date results | | 丛书名称 | Lecture Notes in Computer Science | | 图书封面 |  | | 描述 | This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence. | | 出版日期 | Conference proceedings 2013 | | 关键词 | approximation algorithms; finite automata; proof complexity; satisfiability; temporal logic; algorithm an | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-642-40313-2 | | isbn_softcover | 978-3-642-40312-5 | | isbn_ebook | 978-3-642-40313-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 | | issn_series | 0302-9743 | | copyright | Springer-Verlag Berlin Heidelberg 2013 |
The information of publication is updating
|
|
发表于 2025-3-21 16:54:16
