scientific article; zbMATH DE number 176867
From MaRDI portal
Publication:4036698
Recommendations
- Bounding the randomized decision tree complexity of read-once Boolean functions
- Read-Once Functions Revisited and the Readability Number of a Boolean Function
- Functions that are read-once on a subset of their inputs
- Critical properties and complexity measures of read-once Boolean functions
- An improvement on the complexity of factoring read-once Boolean functions
Cited in
(14)- Linear read-once and related Boolean functions
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games
- An improvement on the complexity of factoring read-once Boolean functions
- Bounding the randomized decision tree complexity of read-once Boolean functions
- Certificates of Non-Membership for Classes of Read-Once Functions
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- Combinatorial characterization of read-once formulae
- Functions that are read-once on a subset of their inputs
- A new proof of Stetsenko's theorem
- On read-once Boolean functions in elementary base extended by median
- Non-deterministic communication complexity with few witnesses
- On directional vs. general randomized decision tree complexity for read-once formulas
- On read-once threshold formulae and their randomized decision tree complexity
- Read-Once Functions Revisited and the Readability Number of a Boolean Function
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036698)
