Titlebook: Mathematical Foundations of Computer Science 2005; 30th International S Joanna J?drzejowicz,Andrzej Szepietowski Conference proceedings 200

最高點

殘忍

On the Complexity of Depth-2 Circuits with Threshold Gatesa lower bound on the size of depth two circuits with a threshold gate at the top and a certain type of gates at the bottom. We apply the method for circuits with symmetric gates at the bottom that compute the “inner product mod 2”, and obtain a lower bound of 1.3638.. Although our lower bound is sli

genesis

Isomorphic Implicationve that, depending on the set of constraints, this problem is in P, NP-complete, or NP-hard, coNP-hard, and in .. We show how to extend the NP-hardness and coNP-hardness to .-hardness for some cases, and conjecture that this can be done in all cases.

狗舍

CLOWN

錢財

Generic-Drug

HARP

Linearly Bounded Infinite Graphste automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linearly bounded machines defining them. We present some of their structural properties as well as alternative characterizations in terms of rew

山崩

Basic Properties for Sand Automataal behavior of sand automata proving that the property of ultimate periodicity is undecidable. We believe that the proof technique used for this last result might turn out to be useful for many other results in the same context.

地名詞典

A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphsen considered: – the message passing model, – the shared memory model, – the local computation model. In each model the processes are represented by vertices of a graph and the interactions are represented by edges. In the message passing model and the shared memory model, processes interact by comm