1022 search results - page 13 / 205 » Logspace Complexity of Functions and Structures |
FOCS
1991
IEEE
13 years 11 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
TIT
2010
13 years 2 months ago
2010
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexity. Special attention is paid to the canonical rate-distortion function of a so...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
NAR
2011
12 years 10 months ago
2011
Binary subcomplexes in proteins database (BISC) is a new protein–protein interaction (PPI) database linking up the two communities most active in their characterization: structu...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...