On Boolean threshold functions with minimum specification number
From MaRDI portal
Publication:2105416
DOI10.1016/J.IC.2022.104926OpenAlexW4281754926WikidataQ114172431 ScholiaQ114172431MaRDI QIDQ2105416FDOQ2105416
Authors: Vadim Lozin, Elena Zamaraeva, Victor Zamaraev, N. Yu. Zolotykh
Publication date: 8 December 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2022.104926
Recommendations
Cites Work
- Enumeration of Seven-Argument Threshold Functions
- Title not available (Why is that?)
- On specifying Boolean functions by labelled examples
- On teaching sets of \(k\)-threshold functions
- On the minimal teaching sets of two-dimensional threshold functions
- Estimating the complexity of deciphering a threshold functions in a \(k\)-valued logic
- On the complexity of teaching
- Title not available (Why is that?)
- Linear read-once and related Boolean functions
- Specifying a positive threshold function via extremal points
- Asymptotics of the number of 2-threshold functions
- A characterization of 2-threshold functions via pairs of prime segments
Cited In (4)
Uses Software
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)