Filtrer vos résultats
- 11
- 8
- 9
- 7
- 3
- 1
- 19
- 1
- 2
- 1
- 1
- 2
- 1
- 1
- 1
- 2
- 3
- 3
- 1
- 19
- 10
- 9
- 9
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 19
- 5
- 5
- 4
- 3
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
19 résultats
|
|
|
triés par
|
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
|
|||
Helly property and satisfiability of Boolean formulas defined on set systems,European Journal of Combinatorics, 2010, 31, pp.502-516
Article dans une revue
hal-01199922v1
|
|||
Unification Algorithms Cannot Be Combined in Polynomial TimeInformation and Computation, 2000, 162 (1-2), pp.24-42
Article dans une revue
inria-00099222v1
|
|||
|
|
On the complexity of generalized chromatic polynomialsAdvances in Applied Mathematics, 2018, 94, pp.71-102. ⟨10.1016/j.aam.2017.04.005⟩
Article dans une revue
hal-04485881v1
|
||
On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System[Intern report] 98-R-281 || hermann98c, 1998, 16 p
Rapport
inria-00098565v1
|
|||
The Next Whisky Bar11th International Computer Science Symposium in Russia (CSR'16), 2016, St. Petersburg, Russia. pp.41--56
Communication dans un congrès
hal-03301002v1
|
|||
|
|
On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations23nd International Conference on Mathematical Foundations of Computer Science, 1998, Brno, République Tchèque, pp.257-266
Communication dans un congrès
inria-00098687v1
|
||
On the complexity of counting the Hilbert basis of a linear Diophantine system6th International Conference on Logic for Programming & Automated Reasoning - LPAR'99, Sep 1999, Tbilisi, Georgia, pp.13-32
Communication dans un congrès
inria-00098753v1
|
|||
Computational Complexity of Simultaneous Elementary Matching ProblemsJournal of Automated Reasoning, 1999, 23 (2), pp.107-136
Article dans une revue
inria-00098986v1
|
|||
|
|
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 P completeness of some counting problems[Research Report] RR-2144, INRIA. 1993
Rapport
inria-00074528v1
|
||
As Close as It Gets10th International Workshop on Algorithms and Computation (WALCOM '16), 2016, Kathmandu, Nepal. pp.222--235
Communication dans un congrès
hal-03300998v1
|
|||
|
|
Complexity of Existential Positive First-Order LogicJournal of Logic and Computation, 2013, 23 (4), pp.753-760. ⟨10.1093/logcom/exr043⟩
Article dans une revue
hal-00870985v1
|
||
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
|
|||
|
|
Dichotomy theorem for the generalized unique satisfiability problem[Intern report] 98-R-065 || hermann98b, 1998, 11 p
Rapport
inria-00098730v1
|
||
|
|
MCP: Capturing Big Data by Satisfiability (Tool Description)24th International Conference on Theory and Applications of Satisfiability Testing, 2021, Barcelona, Spain. pp.207 - 215, ⟨10.1007/978-3-030-80223-3_14⟩
Communication dans un congrès
hal-03329013v1
|
||
|
|
How to Find the Exit from a 3-Dimensional Maze *19th Symposium on Experimental Algorithms, Jun 2021, Nice, France. ⟨10.4230/LIPIcs.SEA.2021.21⟩
Communication dans un congrès
hal-03329005v1
|
||
|
|
MCP: Learning Propositional Formulas from Binarized DataADEMAL, Miki Hermann; Nina Narodytska; Corina S. Pasareanu, Jul 2023, Rome, France. ⟨10.4230/OASIcs.ADEMAL.2023⟩
Communication dans un congrès
hal-04307792v1
|
||
|
|
Minimal Distance of Propositional ModelsTheory of Computing Systems, 2019, 63 (6), pp.1131-1184. ⟨10.1007/s00224-018-9896-8⟩
Article dans une revue
hal-02322184v1
|