Titlebook: Mathematical Foundations of Computer Science 1997; 22nd International S Igor Prívara,Peter Ružička Conference proceedings 1997 Springer-Ver

佛刊

,A tile-based coordination view of asynchronous π-calculus,. Two kinds of tiles are provided: activity tiles and .. Activity tiles specify the basic interactions sequential processes are able to perform, without considering the operational environment where they live. Instead, coordination tiles control the global evolution of programs.

Flu表流动

和平

Resolution proofs, exponential bounds, and Kolmogorov complexity, of expander graphs than the ones used in [13]. These expander graphs are located in the core of the construction. We show the existence of our expanders by a Kolmogorov complexity argument which has not been used before in this context and might be of independent interest since the applicability of this method is quite general.

范围广

The complexity of policy evaluation for finite-horizon partially-observable Markov decision processroblem for POMDPs, showing it is complete for Probabilistic Logspace. From this, we prove policy existence problems for several variants of unobservable, succinctly represented MDPs to be complete for NP., a class for which not many natural problems are known to be complete.

骚扰

custody

群岛

Heart-Rate

When are two rewrite systems more than none?,compute normal forms of input terms) and consider the case where individual systems share constructors, but not defined symbols. We present some old and new sufficient conditions under which termination (existence of normal forms, regardless of computation strategy) and confluence (uniqueness) are p

Interferons

languid

Communication complexity and sequential computation,ting problems. This is a consequence of the relation of communication complexity to many fundamental (mainly parallel) complexity measures. This paper focuses on the relation between communication complexity and the following three complexity measures of sequential computation:.We present a survey o