On Boolean threshold functions with minimum specification number

DOI10.1016/j.ic.2022.104926OpenAlexW4281754926WikidataQ114172431 ScholiaQ114172431MaRDI QIDQ2105416

Vadim V. Lozin, Elena Zamaraeva, Nikolai Yu. Zolotykh, Victor Zamaraev

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

zbMATH Keywords

Boolean threshold functionspecification numberessential points

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• JBool

Cites Work

• Unnamed Item
• Unnamed Item
• On teaching sets of \(k\)-threshold functions
• Linear read-once and related Boolean functions
• On the complexity of teaching
• On specifying Boolean functions by labelled examples
• Asymptotics of the number of 2-threshold functions
• A characterization of 2-threshold functions via pairs of prime segments
• On the Minimal Teaching Sets of Two-Dimensional Threshold Functions
• Specifying a positive threshold function via extremal points
• Enumeration of Seven-Argument Threshold Functions
• Estimating the complexity of deciphering a threshold functions in a \(k\)-valued logic

This page was built for publication: On Boolean threshold functions with minimum specification number