| 書目名稱 | Mathematical Foundations of Computer Science 1988 |
| 副標(biāo)題 | 13th Symposium Carls |
| 編輯 | Michal P. Chytil,Václav Koubek,Ladislav Janiga |
| 視頻video | http://file.papertrans.cn/627/626122/626122.mp4 |
| 叢書名稱 | Lecture Notes in Computer Science |
| 圖書封面 |  |
| 描述 | This volume contains 11 invited lectures and 42 communications presented at the 13th Conference on Mathematical Foundations of Computer Science, MFCS ‘88, held at Carlsbad, Czechoslovakia, August 29 - September 2, 1988. Most of the papers present material from the following four fields: - complexity theory, in particular structural complexity, - concurrency and parellelism, - formal language theory, - semantics. Other areas treated in the proceedings include functional programming, inductive syntactical synthesis, unification algorithms, relational databases and incremental attribute evaluation. |
| 出版日期 | Conference proceedings 1988 |
| 關(guān)鍵詞 | algorithm; algorithms; complexity; complexity theory; computer; computer science; database; formal language |
| 版次 | 1 |
| doi | https://doi.org/10.1007/BFb0017126 |
| isbn_softcover | 978-3-540-50110-7 |
| isbn_ebook | 978-3-540-45926-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 1988 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-19 20:35
發(fā)表于 2025-3-21 18:41:00
