找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Mathematical Foundations of Computer Science 1992; 17th International S Ivan M. Havel,Václav Koubek Conference proceedings 1992 Springer-Ve

[复制链接]
查看: 12410|回复: 58
发表于 2025-3-21 16:13:39 | 显示全部楼层 |阅读模式
书目名称Mathematical Foundations of Computer Science 1992
副标题17th International S
编辑Ivan M. Havel,Václav Koubek
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Mathematical Foundations of Computer Science 1992; 17th International S Ivan M. Havel,Václav Koubek Conference proceedings 1992 Springer-Ve
描述This volume contains 10 invited papers and 40 shortcommunicationscontributed for presentation at the 17thSymposium on MathematicalFoundations of Computer Science,held in Prague, Czechoslovakia, August 24-28, 1992.The series of MFCS symposia, organized alternately inPolandand Czechoslovakia since 1972, has a long and wellestablished tradition. The purpose of the series is toencourage high-quality researchin all branches oftheoretical computer science and to bringtogetherspecialists working actively in the area.Numerous topics arecovered in this volume. The invitedpapers cover: range searching withsemialgebraic sets, graphlayout problems, parallel recognition and ranking ofcontext-free languages, expansion of combinatorialpolytopes, neural networks and complexity theory, theory ofcomputation over stream algebras, methods in parallelalgorithms, the complexity of small descriptions, weakparallel machines, and the complexity of graph connectivity.
出版日期Conference proceedings 1992
关键词Datenstrukturen; Komplexität; Nebenläufigkeit; Parallelität; Semantik; Text; algorithms; complexity; concurr
版次1
doihttps://doi.org/10.1007/3-540-55808-X
isbn_softcover978-3-540-55808-8
isbn_ebook978-3-540-47291-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1992
The information of publication is updating

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




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




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




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




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




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




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




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




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




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




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

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:15:22 | 显示全部楼层
Avi Wigderson Schädigungen wie z. B. Schädel-Hirn-Traumata, Schlaganfälle, Rückenmarksschädigungen, Myasthenia gravis oder Multiple Sklerose zurückzuführen sind, können Schluckstörungen auch im Rahmen von rheumatoider Arthritis und Sklerodermie oder bei anatomischen Veränderungen im kraniozervikalen Bereich, als
发表于 2025-3-22 01:07:20 | 显示全部楼层
Holger Bast,Martin Dietzfelbinger,Torben Hagerupitung in auf- und absteigenden Bahnsystemen als auch der intrinsischen Rückenmarksfunktionen. Die resultierende Symptomatik hängt dabei weniger von der Ursache der Schädigung als von der Höhe und Geschwindigkeit ab, mit der sie sich entwickelt hat. Eine komplette Querschnittslähmung beinhaltet einen
发表于 2025-3-22 06:10:36 | 显示全部楼层
发表于 2025-3-22 12:19:47 | 显示全部楼层
Parallel recognition and ranking of context-free languages,hine without write conflicts. The efficiency of the algorithm is the total number of operations (the product of time and number of processors). Such efficiency depends heavily on the class of context-free grammars and on the meaning of ‘fast’: log(n), log.n or sublinear time. The slower is the algor
发表于 2025-3-22 13:49:06 | 显示全部楼层
发表于 2025-3-22 19:32:28 | 显示全部楼层
Methods in parallel algorithmcs,c studies for parallel computers..Some of the collective knowledge-base on non-numerical parallel algorithms can be characterized in a structural way. Each structure relates a few problems and technique to one another from the basic to the more involved. The second half of the talk will: (1) overvie
发表于 2025-3-23 00:52:03 | 显示全部楼层
On the complexity of small description and related topics,problem of obtaining the polynomial size circuits for a given set in P/poly by using the set as an oracle. Recent results on upper and lower bounds of the relative complexity of this problem are presented. We also introduce two related research topics — query learning and identity mapping network —
发表于 2025-3-23 02:22:01 | 显示全部楼层
发表于 2025-3-23 08:05:32 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-29 06:01
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表