On boolean functions and connected sets
From MaRDI portal
Cites work
- Binomial Coefficients Modulo a Prime
- Definability and decision problems in arithmetic
- Elementary properties of Abelian groups
- Horn sentences
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3314813 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- scientific article; zbMATH DE number 3083503 (Why is no real title available?)
- Reduced products, Horn sentences, and decision problems
Cited in
(7)- On k-stable functions
- Compositional complexity of Boolean functions
- Interpolation of functions over a measure space and conjectures about memory
- Practical decidability
- Minimization of pseudo-Boolean functions by binary development
- On sets of relations definable by addition
- scientific article; zbMATH DE number 3396878 (Why is no real title available?)
This page was built for publication: On boolean functions and connected sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5625156)