Titlebook: Mathematical Foundations of Computer Science 1995; 20th International S Jiří Wiedermann,Petr Hájek Conference proceedings 1995 Springer-Ver

微不足道

Decomposable structures, Boolean function representations, and optimization,We show the connection between the theory of bounded treewidth graphs, monadic second order definable structures and sets, and boolean decision diagrams. We survey recent results in algorithms for bounded treewidth, symbolic model checking and representation schemes for Boolean functions. Some practical applications are indicated.

两种语言

Symbolic dynamics and finite automata,In this survey, we present some connections between notions and results in automata theory and other ones in symbolic dynamics.

以烟熏消毒

Ranked structures in nonmonotonic reasoning and belief revision: Abstract,

修正案

不妥协

反省

埋葬

DOLT

On the complexity of finite memory policies for Markov decision processes,general situation. Nevertheless, the class of finite memory policies seems to be of interest for probabilistic policies: though probabilistic policies are not better than deterministic ones in the general class of history remembering policies, the former ones can be better in the class of finite mem

avulsion

Derandomization for sparse approximations and independent sets,on and Radhakrishnan [HR], we give an efficient algorithm which computes an independent set of size .for a graph . on . vertices with maximum degree ., if . contains only a little less than the maximum possible number of triangles (say .. many for a positive constant .). This algorithm is based on e

热情的我