ERUPT 发表于 2025-3-25 05:31:52

http://reply.papertrans.cn/63/6262/626122/626122_21.png

geriatrician 发表于 2025-3-25 09:26:37

Robust oracle machines,istic "witness searching" process in NP problems. It is shown that straightforward modifications of the original notion are closely related with other concepts in structural complexity theory, such as "self-reducibility", "lowness", and "interactive proof systems".

Antecedent 发表于 2025-3-25 13:04:30

http://reply.papertrans.cn/63/6262/626122/626122_23.png

disciplined 发表于 2025-3-25 16:15:24

Comparing interconnection networks,escriptions of efficient methods to simulate an algorithm designed for one type of architecture on a different network structure and/or techniques to distribute data/program variables to achieve optimum use of all available processors.

HUMP 发表于 2025-3-25 21:53:29

Distribution of Sequential Processes,y equivalent concurrent processes? The models of systems are finite automata in the non-distributed case and some collection of finite automata with synchronization in the distributed case. The concurrency criterion is commutativity.

Kaleidoscope 发表于 2025-3-26 02:18:17

http://reply.papertrans.cn/63/6262/626122/626122_26.png

reception 发表于 2025-3-26 05:48:25

Reusable specification components,ation. Every node of the tree is a structured specification. In contrast to other approaches to software reusability these trees are considered as objects of the language and can be constructed and manipulated by operators of the language.

松驰 发表于 2025-3-26 10:20:55

http://reply.papertrans.cn/63/6262/626122/626122_28.png

Meager 发表于 2025-3-26 15:55:58

http://reply.papertrans.cn/63/6262/626122/626122_29.png

小丑 发表于 2025-3-26 17:25:42

http://reply.papertrans.cn/63/6262/626122/626122_30.png
页: 1 2 [3] 4 5 6 7
查看完整版本: Titlebook: Mathematical Foundations of Computer Science 1988; 13th Symposium Carls Michal P. Chytil,Václav Koubek,Ladislav Janiga Conference proceedin