16 search results - page 1 / 4 » Monotone Circuits for Matching Require Linear Depth |
STOC
1990
ACM
14 years 2 months ago
1990
ACM
We prove that monotone circuits computing the perfect matching function on n-vertex graphs require (n) depth. This implies an exponential gap between the depth of monotone and non...
CRYPTO
2005
Springer
14 years 4 months ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
IPL
2007
13 years 10 months ago
2007
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
COCO
2009
Springer
14 years 5 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
CVPR
2010
IEEE
14 years 7 months ago
2010
IEEE
Future progress in neuroscience hinges on reconstruction of neuronal circuits to the level of individual synapses. Because of the specifics of neuronal architecture, imaging must ...