On Boolean threshold functions with minimum specification number
From MaRDI portal
Publication:2105416
Recommendations
Cites work
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 3266648 (Why is no real title available?)
- A characterization of 2-threshold functions via pairs of prime segments
- Asymptotics of the number of 2-threshold functions
- Enumeration of Seven-Argument Threshold Functions
- Estimating the complexity of deciphering a threshold functions in a \(k\)-valued logic
- Linear read-once and related Boolean functions
- On specifying Boolean functions by labelled examples
- On teaching sets of k-threshold functions
- On the complexity of teaching
- On the minimal teaching sets of two-dimensional threshold functions
- Specifying a positive threshold function via extremal points
Cited in
(4)
This page was built for publication: On Boolean threshold functions with minimum specification number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105416)