找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Mathematical Foundations of Computer Science 1999; 24th International S Mirosław Kutyłowski,Leszek Pacholski,Tomasz Wierzb Conference proce

[复制链接]
查看: 26897|回复: 60
发表于 2025-3-21 19:05:40 | 显示全部楼层 |阅读模式
书目名称Mathematical Foundations of Computer Science 1999
副标题24th International S
编辑Mirosław Kutyłowski,Leszek Pacholski,Tomasz Wierzb
视频video
概述Includes supplementary material:
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Mathematical Foundations of Computer Science 1999; 24th International S Mirosław Kutyłowski,Leszek Pacholski,Tomasz Wierzb Conference proce
描述This volume contains papers selected for presentation during the 24th Interna­ tional Symposium on Mathematical Foundations of Computer Science held on September 6-10, 1999 in Szklarska Por^ba, Poland. The symposium, organized alternately in the Czech Republic, Slovakia, and Poland, focuses on theoretical aspects and mathematical foundations of computer science. The scientific program of the symposium consists of five invited talks given by Martin Dyer, Dexter Kozen, Giovanni Manzini, Sergio Rajsbaum, and Mads Tofte, and 37 accepted papers chosen out of 68 submissions. The volume contains all accepted contributed papers, and three invited papers. The contributed papers have been selected for presentation based on their scientific quality, novelty, and interest for the general audience of MFCS par­ ticipants. Each paper has been reviewed by at least three independent referees — PC members and/or sub-referees appointed by them. The papers were se­ lected for presentation during a fully electronic virtual meeting of the program committee on May 7, 1999. The virtual PC meeting was supported by software written by Artur Zgoda, Ph.D. student at the University of Wroclaw. The entire commu
出版日期Conference proceedings 1999
关键词Automat; Bisimulation; algorithms; automata; complexity; computer; computer science; distributed computing;
版次1
doihttps://doi.org/10.1007/3-540-48340-3
isbn_softcover978-3-540-66408-6
isbn_ebook978-3-540-48340-3Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1999
The information of publication is updating

书目名称Mathematical Foundations of Computer Science 1999影响因子(影响力)




书目名称Mathematical Foundations of Computer Science 1999影响因子(影响力)学科排名




书目名称Mathematical Foundations of Computer Science 1999网络公开度




书目名称Mathematical Foundations of Computer Science 1999网络公开度学科排名




书目名称Mathematical Foundations of Computer Science 1999被引频次




书目名称Mathematical Foundations of Computer Science 1999被引频次学科排名




书目名称Mathematical Foundations of Computer Science 1999年度引用




书目名称Mathematical Foundations of Computer Science 1999年度引用学科排名




书目名称Mathematical Foundations of Computer Science 1999读者反馈




书目名称Mathematical Foundations of Computer Science 1999读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:42:52 | 显示全部楼层
发表于 2025-3-22 02:15:48 | 显示全部楼层
发表于 2025-3-22 07:18:59 | 显示全部楼层
发表于 2025-3-22 11:01:58 | 显示全部楼层
Multiparty Communication Complexity: Very Hard Functionsnd a particular very hard function was proposed in [.], where it has been shown that almost all functions are very hard. We also prove that combining two very hard functions by the boolean operation xor gives a very hard function.
发表于 2025-3-22 16:39:27 | 显示全部楼层
On Some Topological Properties of Linear Cellular Automata complete characterization of the subspace where periodic points are dense. For what concerns topological mixing, we prove that this property is equivalent to transitivity and then easily checkable. Finally, we classify linear cellular automata according to the definition of chaos given by Devaney in [.].
发表于 2025-3-22 17:26:54 | 显示全部楼层
Conference proceedings 1999n September 6-10, 1999 in Szklarska Por^ba, Poland. The symposium, organized alternately in the Czech Republic, Slovakia, and Poland, focuses on theoretical aspects and mathematical foundations of computer science. The scientific program of the symposium consists of five invited talks given by Marti
发表于 2025-3-22 22:16:29 | 显示全部楼层
发表于 2025-3-23 04:01:15 | 显示全部楼层
发表于 2025-3-23 08:30:30 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-29 05:38
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表