自由
发表于 2025-3-21 20:07:42
书目名称Mathematical Foundations of Computer Science 1986影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0626121<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 1986影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0626121<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 1986网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0626121<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 1986网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0626121<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 1986被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0626121<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 1986被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0626121<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 1986年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0626121<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 1986年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0626121<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 1986读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0626121<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 1986读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0626121<br><br> <br><br>
chandel
发表于 2025-3-21 20:25:09
Partial interpretations of higher order algebraic types,pes, i.e. types comprising higher order functions are treated, too. This allows an algebraic (“equational”) specification of algebras including sorts with “infinite” objects and higher order functions (“functionals”).
贞洁
发表于 2025-3-22 01:24:36
Geometric location problems and their complexity,osing circle, largest empty circle, fixed circle placement, and their variations. Most of the algorithms mentioned are asymptotically optimal to within a constant factor under the algebraic computation tree model. Finally, a geometric competitive location problem is discussed and some open problems suggested.
平淡而无味
发表于 2025-3-22 05:55:40
http://reply.papertrans.cn/63/6262/626121/626121_4.png
铁塔等
发表于 2025-3-22 11:13:50
http://reply.papertrans.cn/63/6262/626121/626121_5.png
免除责任
发表于 2025-3-22 15:23:35
Deterministic simulation of idealized parallel computers on more realistic ones, prove an Ω((log .)./log log .) lower bound on the number of steps needed to simulate one PRAM step on a bounded degree network under the assumption that the communication in the network is point-to-point.
相容
发表于 2025-3-22 19:27:04
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/626121.jpg
证明无罪
发表于 2025-3-23 00:55:29
https://doi.org/10.1007/BFb0016229Alphabet; Simula; algorithm; algorithms; automata; class; complexity; complexity theory; data structure; logi
凶猛
发表于 2025-3-23 04:51:42
http://reply.papertrans.cn/63/6262/626121/626121_9.png
Jacket
发表于 2025-3-23 08:37:04
Parallel arithmetic computations: A survey,A survey of parallel algorithms for algebraic problems is presented.