Titlebook: Mathematical Foundations of Computer Science 1986; 12th Symposium held Jozef Gruska,Branislav Rovan,Juraj Wiedermann Conference proceeding

自由

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




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




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




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




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




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




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




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




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




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

chandel

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”).

贞洁

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.

平淡而无味

铁塔等

免除责任

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.

相容

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/626121.jpg

证明无罪

https://doi.org/10.1007/BFb0016229Alphabet; Simula; algorithm; algorithms; automata; class; complexity; complexity theory; data structure; logi

凶猛

Jacket

Parallel arithmetic computations: A survey,A survey of parallel algorithms for algebraic problems is presented.