13603 search results - page 123 / 2721 » On the Complexity of Computing Treelength |
MFCS
1989
Springer
14 years 24 days ago
1989
Springer
CIE
2010
Springer
14 years 19 days ago
2010
Springer
CSR
2008
Springer
13 years 10 months ago
2008
Springer
CSE
2007
IEEE
13 years 9 months ago
2007
IEEE
ECCC
2000
13 years 9 months ago
2000
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...