63 search results - page 5 / 13 » On the Computational Complexity of Cut-Elimination in Linear... |
EUROCOLT
1999
Springer
13 years 12 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
CSL
2005
Springer
14 years 1 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
LICS
2006
IEEE
14 years 1 months 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...
ICDM
2009
IEEE
13 years 5 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...