Stefan Mengel

Available identifiers

zbMath Open mengel.stefanMaRDI QIDQ269341

List of research outcomes

Publication	Date of Publication	Type
Bounds on BDD-based bucket elimination	2024-11-26	Paper
An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages	2024-10-31	Paper
Changing partitions in rectangle decision lists	2024-07-12	Paper
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations	2023-03-13	Paper
https://portal.mardi4nfdi.de/entity/Q5091134	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5091137	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5090465	2022-07-18	Paper
No Efficient Disjunction or Conjunction of Switch-Lists	2022-06-01	Paper
Proof complexity of symbolic QBF reasoning	2022-03-22	Paper
Characterizing Tseitin-formulas with short regular resolution refutations	2022-03-22	Paper
Characterizing tractability of simple well-designed pattern trees with projection	2021-06-24	Paper
The logic of counting query answers	2021-01-19	Paper
Enumeration on trees under relabelings	2020-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q5111443	2020-05-27	Paper
Revisiting graph width measures for CNF-encodings	2020-05-20	Paper
Graph width measures for CNF-encodings with auxiliary variables	2020-05-14	Paper
Minimal distance of propositional models	2019-09-05	Paper
Lower bounds on the mim-width of some graph classes	2018-09-17	Paper
QBF as an alternative to Courcelle's theorem	2018-08-10	Paper
On the relative power of reduction notions in arithmetic circuit complexity	2017-11-22	Paper
A trichotomy in the complexity of counting answers to conjunctive queries	2017-06-13	Paper
The arithmetic complexity of tensor contractions	2017-01-30	Paper
Understanding model counting for \(\beta\)-acyclic CNF-formulas	2017-01-24	Paper
Parameterized compilation lower bounds for restricted CNF-formulas	2016-09-05	Paper
The next whisky bar	2016-07-25	Paper
The arithmetic complexity of tensor contraction	2016-06-03	Paper
As Close as It Gets	2016-05-03	Paper
Structural tractability of counting of solutions to conjunctive queries	2016-04-18	Paper
Give me another one!	2016-01-11	Paper
On compiling CNFs into structured deterministic DNNFs	2015-11-20	Paper
Monomials in arithmetic circuits: complete problems in the counting hierarchy	2015-07-08	Paper
Hypergraph acyclicity and propositional model counting	2014-09-26	Paper
The complexity of weighted counting for acyclic conjunctive queries	2014-01-28	Paper
Arithmetic branching programs with memory	2013-09-20	Paper
Monomials in arithmetic circuits: complete problems in the counting hierarchy	2012-08-23	Paper
Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems	2011-07-06	Paper

Research outcomes over time

This page was built for person: Stefan Mengel