Polynomial threshold functions of bounded tree-width: some explainability and complexity aspects
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 67477 (Why is no real title available?)
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 1504634 (Why is no real title available?)
- scientific article; zbMATH DE number 1859215 (Why is no real title available?)
- An FPTAS for #Knapsack and Related Counting Problems
- Analysis of Boolean Functions
- Bayesian network classifiers
- Boolean function complexity. Advances and frontiers.
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Branching Programs and Binary Decision Diagrams
- Computing Boolean functions by polynomials and threshold circuits
- Counting truth assignments of formulas of bounded tree-width or clique-width
- Decision boundary for discrete Bayesian network classifiers
- Deterministic Approximate Counting of Polynomial Threshold Functions via a Derandomized Regularity Lemma.
- Extremal properties of polynomial threshold functions
- Logic for explainable AI
- Lower bounds on monotone complexity of the logical permanent
- Modeling and Reasoning with Bayesian Networks
- Monotone versus positive
- Nearest neighbor representations of Boolean functions
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- Polynomial threshold functions and Boolean threshold circuits
- Probabilistic graphical models.
- Size of ordered binary decision diagrams representing threshold functions
- The Power of Negative Thinking in Multiplying Boolean Matrices
- The gap between monotone and non-monotone circuit complexity is exponential
- The vertex separation number of a graph equals its path-width
- Tree-width, path-width, and cutwidth
This page was built for publication: Polynomial threshold functions of bounded tree-width: some explainability and complexity aspects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7236637)
