Sciweavers

29908 search results - page 190 / 5982
» On the Complexity of
Sort
View
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 11 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
GI
2003
Springer
15 years 11 months ago
An Integrated Approach to Survivability Analysis of Large Complex Critical Infrastructures
: The integrated approach for analysis of Large Complex Critical Infrastructures (LCCIs) to afford survivability aimed at preparing a Roadmap for Research and Development for criti...
Sandro Bologna, Thomas Beer
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 11 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
STACS
1993
Springer
15 years 10 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
15 years 10 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams