Sciweavers

52
Voted
FCT
2009
Springer
15 years 4 months ago
Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL
Michael Huth, Nir Piterman, Daniel Wagner
81
Voted
FCT
2009
Springer
15 years 4 months ago
Small-Space Analogues of Valiant's Classes
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
Meena Mahajan, B. V. Raghavendra Rao
FCT
2009
Springer
15 years 4 months ago
Energy Complexity and Depth of Threshold Circuits
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...
Kei Uchizawa, Takao Nishizeki, Eiji Takimoto