27 search results - page 3 / 6 » fct 2009 |
FCT
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In the paper we show that there is a close relationship between the energy complexity and the depth of threshold circuits computing any Boolean function although they hav...
FCT
2009
Springer
13 years 11 months ago
2009
Springer
Despite of their applicability betweennness constraints have (to the authorās knowledge) hardly been considered from the random structures point of view. They are essentially diļ...
FCT
2009
Springer
13 years 11 months ago
2009
Springer
We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an inļ¬nitely repeate...
FCT
2009
Springer
13 years 11 months ago
2009
Springer
We study the empire colouring problem (as deļ¬ned by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
FCT
2009
Springer
13 years 11 months ago
2009
Springer
We study the equivalence problem of deterministic nested word to word transducers and show it to be suprisingly robust. Modulo polynomal time reductions, it can be identiļ¬ed with...