scientific article

zbMath0764.06006MaRDI QIDQ4036698

Ilan Newman

Publication date: 18 May 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

read-once functionsread-once Boolean functionsrandomized Boolean decision tree complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Related Items (4)

Non-deterministic communication complexity with few witnesses ⋮ Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees ⋮ Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games ⋮ Read-Once Functions Revisited and the Readability Number of a Boolean Function

This page was built for publication: