Sciweavers

380 search results - page 1 / 76
» A Categorical Setting for Lower Complexity
Sort
View
ENTCS
2010
116views more  ENTCS 2010»
13 years 11 months ago
A Categorical Setting for Lower Complexity
A polarized strong category consists of a cartesian category, X, and a category Y, together with a module M : X
Robin Cockett, Brian F. Redmond
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 4 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 11 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
JC
2011
87views more  JC 2011»
13 years 5 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski