Filtrer vos résultats
- 8
- 4
- 6
- 4
- 2
- 12
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 12
- 6
- 4
- 3
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 12
- 4
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
12 résultats
|
|
|
triés par
|
|
|
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine SystemTheoretical Computer Science, 2002, 270 (1-2), pp.625-642. ⟨10.1016/S0304-3975(01)00017-2⟩
Article dans une revue
inria-00100710v1
|
||
On the complexity of recognizing the Hilbert basis of a linear Diophantine system24th International Symposium on Mathematical Foundations of Computer Science - MFCS'99, 1999, Szklarska Poreba, Poland, pp.92-102
Communication dans un congrès
inria-00098956v1
|
|||
Impossibility of essential real-time garbage collection in the general caseProceedings of the 3nd International Conferences on Computer Science and Information Technologies, 2001, Yerevan, Armenia. pp.113-117
Communication dans un congrès
hal-00094632v1
|
|||
|
|
Enumerating answers to first-order queries over databases of low degreeProceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS'14, Snowbird, UT, USA, June 22-27, 2014, Jun 2014, Snowbird, United States. pp.121--131, ⟨10.1145/2594538.2594539⟩
Communication dans un congrès
hal-01070898v1
|
||
The Arithmetic Complexity of Tensor ContractionTheory of Computing Systems, 2016, 58 (4), pp.506 - 527. ⟨10.1007/s00224-015-9630-8⟩
Article dans une revue
hal-01700746v1
|
|||
|
|
First-order queries on structures of bounded degree are computable with constant delayACM Transactions on Computational Logic, 2007, 8 (4), pp.1-18
Article dans une revue
hal-00195016v1
|
||
|
|
Efficient Enumeration for Conjunctive Queries over X-underbar Structures19th EACSL Annual Conference on Computer Science Logic, Aug 2010, Brno, Czech Republic. pp.80-94, ⟨10.1007/978-3-642-15205-4_10⟩
Communication dans un congrès
hal-00489955v1
|
||
On Acyclic Conjunctive Queries and Constant Delay EnumerationComputer Science Logic 2007, Sep 2007, Lausanne, Switzerland. pp.208-222
Communication dans un congrès
hal-00195010v1
|
|||
|
|
Modular SAT-based techniques for reasoning tasks in team semantics2023
Pré-publication, Document de travail
hal-04032065v1
|
||
Subtractive Reductions and Complete Problems for Counting Complexity Classes25th International Symposium on Mathematical Foundations of Computer Science - MFCS'2000, 2000, Bratislava, Slovaquie, pp.323-332
Communication dans un congrès
inria-00099381v1
|
|||
|
|
Computing the JTH solution of a first-order queryRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2008, 42, pp.147-164
Article dans une revue
hal-00221730v1
|
||
|
|
The complexity of acyclic conjunctive queries revisited2006
Pré-publication, Document de travail
hal-00023582v1
|