13603 search results - page 44 / 2721 » On the Complexity of Computing Treelength |
201
click to vote
CSR
2011
Springer
14 years 7 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
144
click to vote
COMPLEXITY
2007
15 years 4 months ago
2007
Distributed computing systems are becoming bigger and more complex. While the complexity of large-scale distributed systems has been acknowledged to be an important challenge, the...
124
click to vote
ECCC
2002
15 years 3 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
134
click to vote
VIS
2007
IEEE
16 years 5 months ago
2007
IEEE
The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and th...