44 search results - page 7 / 9 » Boolean Functions, Invariance Groups and Parallel Complexity |
LREC
2008
13 years 8 months ago
2008
When dealing with large, distributed systems that use state-of-the-art components, individual components are usually developed in parallel. As development continues, the decouplin...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
HIPC
2009
Springer
13 years 5 months ago
2009
Springer
Supercomputers are prone to frequent faults that adversely affect their performance, reliability and functionality. System logs collected on these systems are a valuable resource o...
COCO
2005
Springer
14 years 27 days ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
CC
2007
Springer
13 years 7 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...