FCT 2009 | Sciweavers

27

click to vote

FCT
2009
Springer

105views Applied Computing» more FCT 2009»

Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL

14 years 6 months ago

Download www.doc.ic.ac.uk

Michael Huth, Nir Piterman, Daniel Wagner

claim paper

Read More »

42

click to vote

FCT
2009
Springer

110views Applied Computing» more FCT 2009»

Small-Space Analogues of Valiant's Classes

14 years 6 months ago

Download www.imsc.res.in

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

claim paper

Read More »

35

click to vote

FCT
2009
Springer

145views Applied Computing» more FCT 2009»

Energy Complexity and Depth of Threshold Circuits

14 years 6 months ago

Download www.nishizeki.ecei.tohoku.ac.jp

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

claim paper

Read More »

23

click to vote

FCT
2009
Springer

132views Applied Computing» more FCT 2009»

Correcting Sorted Sequences in a Single Hop Radio Network

14 years 6 months ago

Download www.im.pwr.wroc.pl

Marcin Kik

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers