The Weight in Enumeration
From MaRDI portal
Publication:5738998
DOI10.1007/978-3-319-53733-7_15zbMath1485.68114arXiv1612.00675OpenAlexW2560739502MaRDI QIDQ5738998
No author found.
Publication date: 1 June 2017
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.00675
Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Nonnumerical algorithms (68W05) Classical propositional logic (03B05) Computational aspects of satisfiability (68R07)
Cites Work
- Unnamed Item
- The complexity of weighted and unweighted \(\#\)CSP
- The complexity of propositional implication
- On generating all maximal independent sets
- Subtractive reductions and complete problems for counting complexity classes
- Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight
- Complexity Classifications for Propositional Abduction in Post's Framework
- Complexity classifications for different equivalence and audit problems for Boolean circuits
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Enumeration of the Monomials of a Polynomial and Related Complexity Classes
- Enumerating All Solutions for Constraint Satisfaction Problems
- The Complexity of Circumscriptive Inference in Post’s Lattice
- Satisfiability problems for propositional calculi
- On generating all solutions of generalized satisfiability problems
- The complexity of satisfiability problems
- Mathematical Foundations of Computer Science 2003
