Filtrer vos résultats
- 9
- 9
- 8
- 6
- 4
- 18
- 2
- 3
- 1
- 1
- 2
- 4
- 2
- 1
- 2
- 18
- 14
- 14
- 7
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 18
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
18 résultats
|
|
|
triés par
|
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
|
|||
Knowledge Compilation Meets Communication Complexity25th International Joint Conference on Artificial Intelligence (IJCAI'16), 2016, New York, NY, USA, Unknown Region. pp.1008--1014
Communication dans un congrès
hal-03301001v1
|
|||
|
|
Counting Minimal Transversals of β-Acyclic HypergraphsJournal of Computer and System Sciences, 2019, ⟨10.1016/j.jcss.2018.10.002⟩
Article dans une revue
hal-01923090v1
|
||
|
|
Enumerating models of DNF faster: breaking the dependency on the formula sizeDiscrete Applied Mathematics, 2020, ⟨10.1016/j.dam.2020.02.014⟩
Article dans une revue
hal-01891483v1
|
||
|
|
Knowledge compilation languages as proof systems2019
Pré-publication, Document de travail
hal-02163761v1
|
||
|
|
Linear Programs with Conjunctive Database QueriesLogical Methods in Computer Science, In press, Volume 20, Issue 1, ⟨10.46298/lmcs-20(1:9)2024⟩
Article dans une revue
hal-04317553v1
|
||
|
|
Incremental delay enumeration: Space and timeDiscrete Applied Mathematics, 2018, ⟨10.1016/j.dam.2018.06.038⟩
Article dans une revue
hal-01923091v1
|
||
|
|
Knowledge Compilation Languages as Proof SystemsTheory and Applications of Satisfiability Testing – SAT 2019, Jul 2019, Lisbon, Portugal. pp.90-99, ⟨10.1007/978-3-030-24258-9_6⟩
Communication dans un congrès
hal-02445523v1
|
||
|
|
Counting Minimal Transversals of ß-Acyclic Hypergraphs2018
Pré-publication, Document de travail
hal-01610959v2
|
||
|
|
Linear Programs with Conjunctive QueriesICDT 2022 - 25th International Conference on Database Theory, Mar 2022, Edinburgh, United Kingdom
Communication dans un congrès
hal-01981553v1
|
||
|
|
Certifying Top-Down Decision-DNNF CompilersAAAI 2021 - 35th Conference on Artificial Intelligence, Feb 2021, Virtual, France
Communication dans un congrès
hal-03111679v1
|
||
|
|
Geometric Amortization of Enumeration Algorithms40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), Mar 2023, Hamburg, Germany. ⟨10.4230/LIPIcs.STACS.2023.18⟩
Communication dans un congrès
hal-03955911v1
|
||
|
|
Direct Access for Conjunctive Queries with NegationsInternational Conference on Database Theory, Mar 2024, Paestum, Italy. pp.13:1-13:20, ⟨10.4230/LIPIcs.ICDT.2024.13⟩
Communication dans un congrès
hal-04504243v1
|
||
|
|
Understanding the complexity of #SAT using knowledge compilation2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2017, Reykjavik, France. ⟨10.1109/LICS.2017.8005121⟩
Communication dans un congrès
hal-01836195v1
|
||
|
|
Tractable QBF by Knowledge Compilation36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Mar 2019, Berlin, Germany
Communication dans un congrès
hal-01836402v1
|
||
|
|
Connecting Knowledge Compilation Classes and Width ParametersTheory of Computing Systems, 2020, ⟨10.1007/s00224-019-09930-2⟩
Article dans une revue
hal-02163749v1
|
||
|
|
Direct Access for Conjunctive Queries with Negation2023
Pré-publication, Document de travail
hal-04260203v1
|
||
|
|
Ranked Enumeration for MSO on Trees via Knowledge Compilation2023
Pré-publication, Document de travail
hal-04377344v1
|