13603 search results - page 198 / 2721 » On the Complexity of Computing Treelength |
122
click to vote
FPCA
1989
15 years 8 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
125
click to vote
CSR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
159
click to vote
CIE
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
150
click to vote
JAIR
2008
15 years 4 months ago
2008
Although recent years have seen a surge of interest in the computational aspects of social choice, no specific attention has previously been devoted to elections with multiple win...
147
click to vote
ECCC
2006
15 years 4 months ago
2006
Abstract. Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advantage that they are theoretically mor...