On the Complexity of Entailment in Existential Conjunctive First Order Logic with Atomic Negation
Marie-Laure Mugnier
,
Geneviève Simonet
,
Michaël Thomazo
Article dans une revue
lirmm-00681914v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
The Modal Logic of Copy and Remove
Carlos Areces
,
Hans van Ditmarsch
,
Raul Fervari
,
François Schwarzentruber
Article dans une revue
hal-02533970v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Certain Query Answering on Hyperstreams
Momar Sakho
Computational Complexity [cs.CC]. Université de Lille; Inria, 2020. English.
⟨NNT : ⟩
Thèse
tel-03028074v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Abstract Machines for Open Call-by-Value
Beniamino Accattoli
,
Giulio Guerrieri
Article dans une revue
hal-02415780v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Differential Equations for Algebraic Functions
Alin Bostan
,
Frédéric Chyzak
,
Bruno Salvy
,
Grégoire Lecerf
,
Éric Schost
Communication dans un congrès
inria-00138206v2
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Weak-order extensions of an order
Karell Bertet
,
Jens Gustedt
,
Michel Morvan
Article dans une revue
inria-00099565v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Minimizing grid capacity in preemptive electric vehicle charging orchestration: Complexity, exact and heuristic approaches
I. Zaidi
,
Ammar Oulamara
,
L. Idoumghar
,
M. Basset
Article dans une revue
hal-04511489v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Incremental complexity of a bi-objective hypergraph transversal problem
Ricardo Andrade
,
Etienne E. Birmelé
,
Arnaud Mary
,
Thomas Picchetti
,
Marie-France Sagot
Communication dans un congrès
hal-01149392v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures
Olivier Bournez
,
Felipe Cucker
,
Paulin Jacobé de Naurois
,
Jean-Yves Marion
In 2nd APPSEM II Workshop - APPSEM'04 , Apr 2004, Tallinn/Estonia
Communication dans un congrès
inria-00000520v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
On Maximal Repetitions in Words
Roman Kolpakov
,
Gregory Kucherov
Journal of Discrete Algorithms , 2000, 1 (1), pp.159-186
Article dans une revue
inria-00099092v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System
Miki Hermann
,
Laurent Juban
,
Phokion G. Kolaitis
[Intern report] 98-R-281 || hermann98c, 1998, 16 p
Rapport
inria-00098565v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Formal certification of game-based cryptographic proofs
Santiago Zanella-Béguelin
Computer Science and Game Theory [cs.GT]. École Nationale Supérieure des Mines de Paris, 2010. English.
⟨NNT : 2010ENMP0050⟩
Thèse
pastel-00584350v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Reclaiming the energy of a schedule: models and algorithms
Guillaume Aupy
,
Anne Benoit
,
Fanny Dufossé
,
Yves Robert
[Research Report] RR-7598, INRIA. 2011, pp.21
Rapport
inria-00584944v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Complexity Boundaries for Generalized Guarded Existential Rules
Jean-François Baget
,
Marie-Laure Mugnier
,
Sebastian Rudolph
,
Michaël Thomazo
RR-11006, 2011, 39 p
Rapport
lirmm-00568935v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Étude des problèmes de spilling et coalescing liés à l'allocation de registres en tant que deux phases distinctes
Florent Bouchez
Autre [cs.OH]. Ecole normale supérieure de lyon - ENS LYON, 2009. Français.
⟨NNT : ⟩
Thèse
tel-00403504v2
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Digital Revolution or Anthropocenic Feedback?
Stéphane Grumbach
,
Olivier Hamant
Article dans une revue
hal-01227303v2
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Permutation Flowshop Scheduling Problems with Maximal and Minimal Time Lags
Julien Fondrevelle
,
Ammar Oulamara
,
Marie-Claude Portmann
Computers and Operations Research , 2004, 26 p
Article dans une revue
inria-00100091v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Floating-Point LLL Revisited
Phong Q. Nguyen
,
Damien Stehlé
[Research Report] RR-5387, INRIA. 2004, pp.28
Rapport
inria-00070616v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
On the Complexity of Deduction in the Existential Conjunctive Fragment of FOL with Atomic Negation
Marie-Laure Mugnier
,
Michaël Thomazo
RR-08013, 2008, pp.18
Rapport
lirmm-00285475v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Comptage de l'ensemble des éléments de la base de Hilbert d'un système d'équations diophantiennes linéaires
Laurent Juban
[Interne] 98-R-066 || juban98a, 1998, 31 p
Rapport
inria-00098731v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Unification modulo ACUI plus Homomorphisms/Distributivity
Siva Anantharaman
,
Paliath Narendran
,
Michaël Rusinowitch
2003, pp.442--457
Communication dans un congrès
hal-00080670v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
On the complexity of the F5 Gröbner basis algorithm
Magali Bardet
,
Jean-Charles Faugère
,
Bruno Salvy
Article dans une revue
hal-01064519v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Evolving Structures in Complex Systems
Hugo Cisneros
,
Josef Sivic
,
Tomas Mikolov
Communication dans un congrès
hal-02448134v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time
Raphaël Pagès
ISSAC 2021 - International Symposium on Symbolic and Algebraic Computation , Jul 2021, Saint-Petersbourg / Virtual, Russia. pp.329-336,
⟨10.1145/3452143.3465524⟩
Communication dans un congrès
hal-03270585v2
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Complexity of control-affine motion planning
Frédéric Jean
,
Dario Prandi
Article dans une revue
hal-00909748v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Scheduling strategies for master-slave tasking on heterogeneous processor grids
Cyril Banino
,
Olivier Beaumont
,
Arnaud Legrand
,
Yves Robert
[Research Report] LIP RR-2002-12, Laboratoire de l'informatique du parallélisme. 2002, 2+29p
Rapport
hal-02102060v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
The Iso-Level Scheduling Heuristic for Heterogeneous Processors
Olivier Beaumont
,
Vincent Boudet
,
Yves Robert
[Research Report] LIP RR-2001-22, Laboratoire de l'informatique du parallélisme. 2001, 2+24p
Rapport
hal-02101928v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
PSPACE-Completeness of a Thread Criterion for Cyclic Proofs in Linear Logic with Least and Greatest Fixed Points
Rémi Nollet
,
Alexis Saurin
,
Christine Tasson
TABLEAUX 2019 - 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods , Sep 2019, London, United Kingdom.
⟨10.1007/978-3-030-29026-9_18⟩
Communication dans un congrès
hal-02173207v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Critical Point Computations on Smooth Varieties: Degree and Complexity bounds
Mohab Safey El Din
,
Pierre-Jean Spaenlehauer
International Symposium on Symbolic and Algebraic Computation (ISSAC) , Jul 2016, Waterloo, Canada. pp.183--190,
⟨10.1145/2930889.2930929⟩
Communication dans un congrès
hal-01312750v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Electric Vehicle Scheduling and Optimal Charging Problem: Complexity, Exact and Heuristic Approaches
O Sassi
,
A Oulamara
2014
Pré-publication, Document de travail
hal-01083888v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More