13603 search results - page 44 / 2721 » On the Complexity of Computing Treelength |
CSR
2011
Springer
13 years 18 days 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...
COMPLEXITY
2007
13 years 9 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...
ECCC
2002
13 years 9 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...
VIS
2007
IEEE
14 years 10 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...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE