Sciweavers

3 search results - page 1 / 1
» Representing (0, 1)-matrices by boolean circuits
Sort
View
DM
2010
77views more  DM 2010»
13 years 4 months ago
Representing (0, 1)-matrices by boolean circuits
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...
Stasys Jukna
FOCS
2007
IEEE
13 years 8 months ago
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
Arkadev Chattopadhyay
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 4 months ago
Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits using DNA Strand Displacement
We propose a novel theoretical biomolecular design to implement any Boolean circuit using the mechanism of DNA strand displacement. The design is scalable: all species of DNA stra...
Ehsan Chiniforooshan, David Doty, Lila Kari, Shinn...