A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
Computational Complexity of Deciding Provability in Linear Logic and its Fragments
[article]
2021
arXiv
pre-print
Preserved Fulltext
We prove an original complexity characterization of a fragment of the logic and present ideas for a new, structural approach to the examination of provability in linear logic. ...
We present the current state of the complexity-theoretic characterization of the most important fragments of linear logic. ...
"Linear Logic and Sub-polynomial Classes of Complexity. (Logique linéaire et classes de complexité sous-polynomiales)". PhD thesis. ...
arXiv:2110.00562v1
fatcat:a6sidawnbjh5jpf2cvrermfrcy
Aspects géométriques et intégrables des modèles de matrices aléatoires
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Then, following the approach of (bi) orthogonal polynomials introduced by Mehta to compute partition functions, we will find Riemann-Hilbert and isomonodromic problems connected to matrix models, making ...
the link with the theory of Jimbo, Miwa and Ueno. ...
This work was done at the University of Montréal at the departement of mathematics and statistics and the Centre de Recherche Mathématique (CRM) and O.M. would like to thank both for their hospitality. ...
arXiv:1012.4513v1
fatcat:nn2bs2qv7fh2ti5p2zvdzeq5ry
Study Of Debris Discs With A New Generation Model
2014
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Nonetheless, robust models have to be developed, that are able to take into account the complexity of the physics associated with these discs, especially the interactions between the collisions and dynamics ...
and taking into account the evolution of dust in debris discs. ...
The authors would like to thank Mark Wyatt for pointing out the limitation inherent in the finite size of the collisional grid, and Zoe Leinhardt for fruitful discussions of collisional prescriptions. ...
doi:10.5281/zenodo.31468
fatcat:copokzsovveqbecrbpfokeor7m
Techniques combinatoires pour les algorithmes paramétrés et les noyaux, avec applications aux problèmes de multicoupe. Sciences et Techniques du Languedoc THÈSE
2013
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Cette reconnaissance peut s'effectuer avec la même complexité que la reconnaissance des graphes de cercle, en temps quadratique avec l'algorithme de Spinrad [119] , et même en temps quasi-linéaire avec ...
L'ensemble de cordes est alors appelé un modèle de G Une des sous-classes naturelles des graphes de cercle est la classe des graphes de cercle de Helly. ...
Nous montrons que Multicoupe dans les arbres admet un noyau polynomial, c'est-à-dire est réductible aux instances de taille polynomiale en k. ...
fatcat:niffvydnxjbgroiw2w6cejbhny
High-level Petri net model checking : the symbolic way
2011
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Remerciements Cette thèse n'aurait pas été possible sans le concours de nombreuses personnes très importantes. ...
Acknowledgments This dissertation would not have been possible without the support of numerous important people.
Remerciements i Acknowledgments iii ...
with a sub-linear complexity. ...
doi:10.13097/archive-ouverte/unige:21844
fatcat:wrccaa3vtrdatn3qcvejpo2kmu