Sciweavers

13603 search results - page 123 / 2721
» On the Complexity of Computing Treelength
Sort
View
95
Voted
MFCS
1989
Springer
15 years 8 months ago
Switching Graphs and Their Complexity
Christoph Meinel
CIE
2010
Springer
15 years 8 months ago
Avoiding Simplicity Is Complex
Eric Allender
ECCC
2000
158views more  ECCC 2000»
15 years 5 months ago
On the Computational Power of Winner-Take-All
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 ...
Wolfgang Maass