63 search results - page 1 / 13 » 06111 Abstracts Collection -- Complexity of Boolean Function... |
DAGSTUHL
2006
13 years 6 months ago
2006
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...
UC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
CC
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
INFOCOM
1999
IEEE
13 years 9 months ago
1999
IEEE
Abstract-The Internet today provides no support for privacy or authentication of multicast packets. However,an increasing number of applications will require secure multicast servi...