16666 search results - page 425 / 3334 » Descriptive and Computational Complexity |
220
click to vote
CSR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
175
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The swarm metaphor stands for dynamic, complex interaction networks with the possibility of emergent phenomena. In this work, we present two games that challenge the vide...
151
click to vote
LICS
2006
IEEE
16 years 27 days ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
177
click to vote
PKDD
2004
Springer
16 years 7 days ago
2004
Springer
One of the most important operations involving Data Mining patterns is computing their similarity. In this paper we present a general framework for comparing both simple and comple...
173
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...