13603 search results - page 81 / 2721 » On the Computational Complexity of Cut-Reduction |
147
click to vote
CSR
2007
Springer
15 years 9 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...
186
click to vote
CIE
2006
Springer
15 years 9 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...
165
click to vote
JAIR
2008
15 years 5 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...
161
click to vote
ACL
2010
15 years 3 months ago
2010
We describe the strategy currently pursued for verbalising OWL ontologies by sentences in Controlled Natural Language (i.e., combining generic rules for realising logical patterns...
165
click to vote
DLT
2009
15 years 3 months ago
2009
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...