scientific article; zbMATH DE number 7378355
From MaRDI portal
Publication:5005139
DOI10.4230/LIPIcs.MFCS.2018.38MaRDI QIDQ5005139
Seyran Saeedi, Niel de Beaudrap, Sevag Gharibian, Marco Aldi
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1712.09617
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on the number of edges in hypertrees
- Model counting for CNF formulas of bounded modular treewidth
- Quasi-gcd computations
- Intersection graphs of k-uniform linear hypergraphs
- Algorithms for propositional model counting
- Counting truth assignments of formulas of bounded tree-width or clique-width
- Extremal Combinatorics
- Solving #SAT and MAXSAT by Dynamic Programming
- Maximal Flow Through a Network
- Quantum Hamiltonian Complexity
- The Complexity of Decision Versus Search
- Linear Time Algorithm for Quantum 2SAT
- On Satisfiability Problems with a Linear Structure
- Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
- Reducibility among Combinatorial Problems
- Theory and Applications of Satisfiability Testing
- The Complexity of the Local Hamiltonian Problem
