Search Sciweavers | Sciweavers

29908 search results - page 620 / 5982

» On the Complexity of

203

Voted

FOCS
1991
IEEE

110views Theoretical Computer Science» more FOCS 1991»

Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates

15 years 11 months ago

Download www.cs.brown.edu

We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a ﬁxed positive...

Anna Gál

claim paper

Read More »

157

click to vote

FOCS
1992
IEEE

94views Theoretical Computer Science» more FOCS 1992»

Separating the Communication Complexities of MOD m and MOD p Circuits

15 years 11 months ago

Download www.cs.elte.hu

: We prove in this paper that it is much harder to evaluate depth

Vince Grolmusz

claim paper

Read More »

216

click to vote

MFDBS
1991

125views Database» more MFDBS 1991»

A Relational Algebra for Complex Objects Based on Partial Information

15 years 11 months ago

Download homepages.inf.ed.ac.uk

We study an approach to relational databases which treats relations not as subsets of a Cartesian product but as subsets of some domain { a partially ordered space of descriptions...

Leonid Libkin

claim paper

Read More »

204

Voted

PARLE
1991

172views Distributed And Parallel Com...» more PARLE 1991»

On the Computational Complexity of Optimal Sorting Network Verification

15 years 11 months ago